./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:20:49,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:20:49,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:20:49,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:20:49,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:20:49,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:20:49,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:20:49,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:20:49,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:20:49,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:20:49,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:20:49,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:20:49,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:20:49,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:20:49,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:20:49,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:20:49,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:20:49,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:20:49,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:20:49,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:20:49,311 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:20:49,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:20:49,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:20:49,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:20:49,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:20:49,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:20:49,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:20:49,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:20:49,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:20:49,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:20:49,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:20:49,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:20:49,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:20:49,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:20:49,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:20:49,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:20:49,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:20:49,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:20:49,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:20:49,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:20:49,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:20:49,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:20:49,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:20:49,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:20:49,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:20:49,346 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:20:49,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:20:49,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:20:49,347 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:20:49,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:20:49,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:20:49,348 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:20:49,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:20:49,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:20:49,349 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:20:49,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:20:49,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:20:49,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:20:49,349 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:20:49,350 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:20:49,350 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:20:49,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:20:49,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:20:49,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:20:49,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:20:49,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:20:49,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:20:49,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:20:49,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:20:49,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:20:49,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:20:49,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:20:49,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:20:49,352 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2022-07-20 06:20:49,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:20:49,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:20:49,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:20:49,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:20:49,564 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:20:49,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-20 06:20:49,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653cb25cd/f93369cc68164d9b973150287ee4dfce/FLAG6b1e30c51 [2022-07-20 06:20:49,954 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:20:49,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-20 06:20:49,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653cb25cd/f93369cc68164d9b973150287ee4dfce/FLAG6b1e30c51 [2022-07-20 06:20:50,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653cb25cd/f93369cc68164d9b973150287ee4dfce [2022-07-20 06:20:50,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:20:50,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:20:50,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:20:50,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:20:50,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:20:50,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e9c585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50, skipping insertion in model container [2022-07-20 06:20:50,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:20:50,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:20:50,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-20 06:20:50,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:20:50,655 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:20:50,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-20 06:20:50,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:20:50,716 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:20:50,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50 WrapperNode [2022-07-20 06:20:50,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:20:50,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:20:50,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:20:50,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:20:50,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,769 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-07-20 06:20:50,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:20:50,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:20:50,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:20:50,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:20:50,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:20:50,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:20:50,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:20:50,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:20:50,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (1/1) ... [2022-07-20 06:20:50,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:20:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:50,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:20:50,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:20:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 06:20:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 06:20:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:20:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:20:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:20:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:20:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:20:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:20:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:20:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:20:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:20:50,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:20:50,988 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:20:51,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:20:51,049 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 06:20:51,184 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:20:51,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:20:51,188 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-20 06:20:51,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:20:51 BoogieIcfgContainer [2022-07-20 06:20:51,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:20:51,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:20:51,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:20:51,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:20:51,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:20:50" (1/3) ... [2022-07-20 06:20:51,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a96908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:20:51, skipping insertion in model container [2022-07-20 06:20:51,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:50" (2/3) ... [2022-07-20 06:20:51,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a96908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:20:51, skipping insertion in model container [2022-07-20 06:20:51,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:20:51" (3/3) ... [2022-07-20 06:20:51,204 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2022-07-20 06:20:51,214 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:20:51,214 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-20 06:20:51,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:20:51,249 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@17f2b04c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3389bf9d [2022-07-20 06:20:51,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-20 06:20:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:20:51,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:51,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:20:51,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-20 06:20:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:51,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645128349] [2022-07-20 06:20:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:51,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645128349] [2022-07-20 06:20:51,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645128349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:51,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:51,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:20:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29932845] [2022-07-20 06:20:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:51,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:51,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:51,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,472 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:51,566 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-07-20 06:20:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:51,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:20:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:51,573 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:20:51,573 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:20:51,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,576 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:51,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:20:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-20 06:20:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-20 06:20:51,609 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-07-20 06:20:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:51,609 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-20 06:20:51,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-20 06:20:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:20:51,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:51,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:20:51,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:20:51,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-20 06:20:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:51,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713410466] [2022-07-20 06:20:51,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:51,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713410466] [2022-07-20 06:20:51,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713410466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:51,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:51,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:20:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497534095] [2022-07-20 06:20:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:51,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,668 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:51,703 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-20 06:20:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:20:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:51,705 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:20:51,705 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:20:51,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,706 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:51,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:20:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-07-20 06:20:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-07-20 06:20:51,710 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-07-20 06:20:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:51,711 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-07-20 06:20:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-07-20 06:20:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:20:51,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:51,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:51,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:20:51,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-07-20 06:20:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:51,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782386147] [2022-07-20 06:20:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:51,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782386147] [2022-07-20 06:20:51,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782386147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:51,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:51,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:20:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142310294] [2022-07-20 06:20:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:51,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,731 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:51,737 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-07-20 06:20:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:51,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:20:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:51,738 INFO L225 Difference]: With dead ends: 66 [2022-07-20 06:20:51,738 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 06:20:51,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,739 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:51,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 06:20:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-07-20 06:20:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-07-20 06:20:51,743 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-07-20 06:20:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:51,744 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-07-20 06:20:51,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-07-20 06:20:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:20:51,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:51,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:51,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:20:51,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-20 06:20:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163065374] [2022-07-20 06:20:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:51,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163065374] [2022-07-20 06:20:51,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163065374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:51,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:51,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:20:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897387782] [2022-07-20 06:20:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:51,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,787 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:51,797 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-20 06:20:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:20:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:51,798 INFO L225 Difference]: With dead ends: 63 [2022-07-20 06:20:51,798 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 06:20:51,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:51,799 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:51,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 06:20:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-20 06:20:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-20 06:20:51,802 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-07-20 06:20:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:51,803 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-20 06:20:51,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-20 06:20:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:20:51,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:51,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:51,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:20:51,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-07-20 06:20:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:51,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201001159] [2022-07-20 06:20:51,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:51,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201001159] [2022-07-20 06:20:51,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201001159] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:51,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106203559] [2022-07-20 06:20:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:51,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:51,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:51,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:51,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:20:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:51,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:20:51,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:51,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:52,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106203559] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:52,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:20:52,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 06:20:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974640595] [2022-07-20 06:20:52,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:52,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:20:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:52,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:20:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:20:52,025 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-20 06:20:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:52,039 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-20 06:20:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:20:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 15 [2022-07-20 06:20:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:52,041 INFO L225 Difference]: With dead ends: 64 [2022-07-20 06:20:52,042 INFO L226 Difference]: Without dead ends: 64 [2022-07-20 06:20:52,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:20:52,049 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:52,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-20 06:20:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-20 06:20:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-20 06:20:52,057 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-07-20 06:20:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:52,057 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-20 06:20:52,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-20 06:20:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-20 06:20:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:20:52,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:52,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:52,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:52,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:52,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-20 06:20:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051735337] [2022-07-20 06:20:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:52,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051735337] [2022-07-20 06:20:52,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051735337] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:52,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836080730] [2022-07-20 06:20:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:52,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:52,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:20:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:52,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:20:52,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:52,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:52,534 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:20:52,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:20:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:52,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:52,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836080730] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:52,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:20:52,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-20 06:20:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946568135] [2022-07-20 06:20:52,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:52,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:20:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:20:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:52,642 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:52,685 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-07-20 06:20:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:20:52,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:20:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:52,686 INFO L225 Difference]: With dead ends: 77 [2022-07-20 06:20:52,686 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 06:20:52,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:20:52,686 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:52,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-20 06:20:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 06:20:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-20 06:20:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-20 06:20:52,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-07-20 06:20:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:52,690 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-20 06:20:52,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-20 06:20:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:20:52,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:52,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:52,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:52,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-20 06:20:52,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-20 06:20:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:52,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824144331] [2022-07-20 06:20:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:53,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824144331] [2022-07-20 06:20:53,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824144331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:53,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230735333] [2022-07-20 06:20:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:53,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:53,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:53,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:53,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:20:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:53,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:20:53,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:53,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:53,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:53,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:53,159 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-20 06:20:53,165 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:20:53,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:20:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230735333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:53,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:20:53,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-20 06:20:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271675943] [2022-07-20 06:20:53,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:20:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:20:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:20:53,321 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:53,400 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-20 06:20:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:20:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:20:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:53,403 INFO L225 Difference]: With dead ends: 76 [2022-07-20 06:20:53,403 INFO L226 Difference]: Without dead ends: 76 [2022-07-20 06:20:53,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:20:53,404 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:53,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-20 06:20:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-20 06:20:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-07-20 06:20:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-20 06:20:53,407 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-07-20 06:20:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:53,407 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-20 06:20:53,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-20 06:20:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:20:53,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:53,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:53,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:53,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:53,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-07-20 06:20:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:53,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478637169] [2022-07-20 06:20:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:53,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478637169] [2022-07-20 06:20:53,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478637169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:53,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126975335] [2022-07-20 06:20:53,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:20:53,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:53,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:53,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:53,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:20:53,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:20:53,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:20:53,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:20:53,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126975335] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:53,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:20:53,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-20 06:20:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951752803] [2022-07-20 06:20:53,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:20:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:20:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:20:53,771 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:53,807 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-07-20 06:20:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:20:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:20:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:53,808 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:20:53,808 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:20:53,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:20:53,809 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:53,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:20:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-20 06:20:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-20 06:20:53,817 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2022-07-20 06:20:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:53,817 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-20 06:20:53,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-20 06:20:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:20:53,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:53,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:53,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:54,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:54,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2022-07-20 06:20:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:54,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637098346] [2022-07-20 06:20:54,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:20:54,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:54,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637098346] [2022-07-20 06:20:54,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637098346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:54,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:54,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:20:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615655618] [2022-07-20 06:20:54,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:54,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:20:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:54,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:20:54,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:54,105 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:54,278 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-20 06:20:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:20:54,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:20:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:54,279 INFO L225 Difference]: With dead ends: 113 [2022-07-20 06:20:54,279 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 06:20:54,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:20:54,281 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:54,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 06:20:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-07-20 06:20:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-20 06:20:54,284 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2022-07-20 06:20:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:54,284 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-20 06:20:54,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-20 06:20:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:20:54,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:54,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:54,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:20:54,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2022-07-20 06:20:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:54,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347200566] [2022-07-20 06:20:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:20:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:54,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347200566] [2022-07-20 06:20:54,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347200566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:54,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:54,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:20:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985528896] [2022-07-20 06:20:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:54,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:20:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:20:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:54,347 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:20:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:54,456 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-20 06:20:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:20:54,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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 23 [2022-07-20 06:20:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:54,457 INFO L225 Difference]: With dead ends: 100 [2022-07-20 06:20:54,457 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 06:20:54,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:20:54,457 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:54,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 06:20:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2022-07-20 06:20:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-20 06:20:54,460 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2022-07-20 06:20:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:54,461 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-20 06:20:54,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:20:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-20 06:20:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:20:54,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:54,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:54,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:20:54,462 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-07-20 06:20:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:54,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922251687] [2022-07-20 06:20:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:20:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:54,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922251687] [2022-07-20 06:20:54,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922251687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:54,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:54,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:20:54,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121511164] [2022-07-20 06:20:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:54,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:20:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:54,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:20:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:54,509 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:20:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:54,605 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-07-20 06:20:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:20:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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 25 [2022-07-20 06:20:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:54,608 INFO L225 Difference]: With dead ends: 100 [2022-07-20 06:20:54,608 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 06:20:54,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:20:54,608 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:54,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 06:20:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2022-07-20 06:20:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-20 06:20:54,619 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 25 [2022-07-20 06:20:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:54,620 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-20 06:20:54,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:20:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-20 06:20:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:20:54,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:54,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:54,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:20:54,621 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:54,621 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-07-20 06:20:54,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:54,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003716075] [2022-07-20 06:20:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:20:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003716075] [2022-07-20 06:20:54,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003716075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755000276] [2022-07-20 06:20:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:54,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:54,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:54,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:20:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:54,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:20:54,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:20:54,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:54,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755000276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:54,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:20:54,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-20 06:20:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771321037] [2022-07-20 06:20:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:54,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:20:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:20:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:20:54,791 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:54,802 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-20 06:20:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:20:54,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 06:20:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:54,803 INFO L225 Difference]: With dead ends: 65 [2022-07-20 06:20:54,803 INFO L226 Difference]: Without dead ends: 65 [2022-07-20 06:20:54,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:20:54,804 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:54,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-20 06:20:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-07-20 06:20:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-07-20 06:20:54,805 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2022-07-20 06:20:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-07-20 06:20:54,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-07-20 06:20:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:20:54,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:54,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:54,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:55,024 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,SelfDestructingSolverStorable11 [2022-07-20 06:20:55,024 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2022-07-20 06:20:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:55,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155838526] [2022-07-20 06:20:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:20:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:55,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155838526] [2022-07-20 06:20:55,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155838526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:55,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59748406] [2022-07-20 06:20:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:55,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:55,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:55,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:55,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:20:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:55,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:20:55,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:20:55,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:55,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59748406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:55,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:20:55,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-07-20 06:20:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883112778] [2022-07-20 06:20:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:20:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:20:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:55,192 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:55,230 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-07-20 06:20:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:20:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:20:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:55,232 INFO L225 Difference]: With dead ends: 49 [2022-07-20 06:20:55,232 INFO L226 Difference]: Without dead ends: 49 [2022-07-20 06:20:55,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:20:55,233 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:55,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-20 06:20:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-20 06:20:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-07-20 06:20:55,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2022-07-20 06:20:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:55,235 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-07-20 06:20:55,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-07-20 06:20:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:20:55,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:55,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:55,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:55,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:55,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2022-07-20 06:20:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:55,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739777426] [2022-07-20 06:20:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:55,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739777426] [2022-07-20 06:20:55,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739777426] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:55,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309204662] [2022-07-20 06:20:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:55,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:55,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:55,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:20:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:55,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 06:20:55,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:55,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:55,704 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:20:55,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:20:55,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:20:55,742 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 06:20:55,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:20:55,755 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:20:55,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 06:20:55,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 06:20:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:55,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:55,934 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-20 06:20:55,934 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 21 treesize of output 20 [2022-07-20 06:20:55,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-20 06:20:55,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-20 06:20:55,982 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:20:55,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-20 06:20:55,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-20 06:20:55,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:20:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:20:56,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309204662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:56,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:20:56,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-07-20 06:20:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368997455] [2022-07-20 06:20:56,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 06:20:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 06:20:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2022-07-20 06:20:56,047 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:56,986 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-07-20 06:20:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:20:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:20:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:56,988 INFO L225 Difference]: With dead ends: 129 [2022-07-20 06:20:56,988 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 06:20:56,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1757, Unknown=4, NotChecked=178, Total=2256 [2022-07-20 06:20:56,989 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 514 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:56,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 721 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 766 Invalid, 0 Unknown, 194 Unchecked, 0.3s Time] [2022-07-20 06:20:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 06:20:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2022-07-20 06:20:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-07-20 06:20:56,991 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2022-07-20 06:20:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:56,991 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-07-20 06:20:56,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-07-20 06:20:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:20:56,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:56,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:57,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:57,193 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2022-07-20 06:20:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538043856] [2022-07-20 06:20:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538043856] [2022-07-20 06:20:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538043856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849846326] [2022-07-20 06:20:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:57,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:57,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:57,405 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:57,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:20:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:57,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 06:20:57,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:57,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:57,565 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:20:57,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:20:57,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:20:57,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:20:57,627 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 06:20:57,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:20:57,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:57,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:20:57,663 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:20:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-20 06:20:57,667 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 41 treesize of output 41 [2022-07-20 06:20:57,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-20 06:20:57,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-20 06:20:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:57,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:58,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:20:58,047 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 46 treesize of output 50 [2022-07-20 06:20:58,073 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_832 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2022-07-20 06:20:58,088 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_830)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_831 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-07-20 06:20:58,102 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:20:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-20 06:20:58,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-20 06:20:58,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:20:58,116 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-20 06:20:58,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2022-07-20 06:20:58,121 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-20 06:20:58,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2022-07-20 06:20:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:20:58,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849846326] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:58,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:20:58,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2022-07-20 06:20:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659773110] [2022-07-20 06:20:58,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:58,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 06:20:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:58,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 06:20:58,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2022-07-20 06:20:58,229 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:59,572 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-07-20 06:20:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:20:59,573 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:20:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:59,574 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:20:59,574 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:20:59,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=2145, Unknown=2, NotChecked=194, Total=2652 [2022-07-20 06:20:59,575 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 809 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:59,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 842 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 786 Invalid, 0 Unknown, 306 Unchecked, 0.4s Time] [2022-07-20 06:20:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:20:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-07-20 06:20:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-20 06:20:59,577 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2022-07-20 06:20:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:59,577 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-20 06:20:59,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-20 06:20:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:20:59,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:59,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:59,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:59,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-20 06:20:59,787 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2022-07-20 06:20:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:59,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426922303] [2022-07-20 06:20:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 06:20:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:59,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426922303] [2022-07-20 06:20:59,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426922303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:59,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:59,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:20:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080671715] [2022-07-20 06:20:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:59,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:20:59,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:20:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:59,857 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:59,941 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-07-20 06:20:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:20:59,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:20:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:59,942 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:20:59,942 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:20:59,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:20:59,942 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:59,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:20:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-07-20 06:20:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-07-20 06:20:59,944 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2022-07-20 06:20:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:59,945 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-07-20 06:20:59,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-07-20 06:20:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:20:59,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:59,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:20:59,946 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:20:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2022-07-20 06:20:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531724791] [2022-07-20 06:20:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:20:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:59,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531724791] [2022-07-20 06:20:59,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531724791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632126304] [2022-07-20 06:20:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:59,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:59,986 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:59,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:21:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:00,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:21:00,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:21:00,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:00,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632126304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:00,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:21:00,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-07-20 06:21:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360359080] [2022-07-20 06:21:00,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:00,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:21:00,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:00,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:21:00,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:00,105 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-20 06:21:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:00,130 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-20 06:21:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:21:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 31 [2022-07-20 06:21:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:00,131 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:21:00,131 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:21:00,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:21:00,131 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:00,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:21:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:21:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-07-20 06:21:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-07-20 06:21:00,134 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 31 [2022-07-20 06:21:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:00,134 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-07-20 06:21:00,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-20 06:21:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-07-20 06:21:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:21:00,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:00,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:00,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:00,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 06:21:00,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:00,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2022-07-20 06:21:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:00,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300655874] [2022-07-20 06:21:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:21:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300655874] [2022-07-20 06:21:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300655874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073461150] [2022-07-20 06:21:00,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:21:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:21:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:21:00,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:21:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:21:00,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:21:00,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:21:00,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:21:00,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:21:00,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:00,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073461150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:00,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:21:00,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-20 06:21:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59625234] [2022-07-20 06:21:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:00,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:21:00,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:21:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:21:00,514 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:00,521 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-20 06:21:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:21:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:21:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:00,522 INFO L225 Difference]: With dead ends: 53 [2022-07-20 06:21:00,522 INFO L226 Difference]: Without dead ends: 53 [2022-07-20 06:21:00,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:21:00,522 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:00,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:21:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-20 06:21:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-20 06:21:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-20 06:21:00,524 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2022-07-20 06:21:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:00,524 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-20 06:21:00,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-20 06:21:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:21:00,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:00,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:00,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:00,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 06:21:00,742 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2022-07-20 06:21:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:00,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480928617] [2022-07-20 06:21:00,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:21:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:00,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480928617] [2022-07-20 06:21:00,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480928617] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:00,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355796590] [2022-07-20 06:21:00,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:21:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:21:00,784 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:21:00,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:21:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:00,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:21:00,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:00,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:00,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355796590] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:21:00,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:21:00,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-07-20 06:21:00,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289017097] [2022-07-20 06:21:00,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:21:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:21:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:21:00,939 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:00,963 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-07-20 06:21:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:21:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:21:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:00,963 INFO L225 Difference]: With dead ends: 57 [2022-07-20 06:21:00,963 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 06:21:00,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:21:00,964 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 79 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:00,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:21:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 06:21:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-20 06:21:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-20 06:21:00,966 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-07-20 06:21:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:00,966 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-20 06:21:00,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-20 06:21:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:21:00,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:00,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:00,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:21:01,176 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2022-07-20 06:21:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:01,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582700462] [2022-07-20 06:21:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:21:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582700462] [2022-07-20 06:21:01,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582700462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148599415] [2022-07-20 06:21:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:01,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:21:01,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:21:01,228 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:21:01,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:21:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:01,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:21:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:01,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:01,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148599415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:21:01,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:21:01,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-20 06:21:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905855831] [2022-07-20 06:21:01,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:01,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:21:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:01,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:21:01,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:01,407 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:01,437 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-07-20 06:21:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:21:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:21:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:01,438 INFO L225 Difference]: With dead ends: 52 [2022-07-20 06:21:01,438 INFO L226 Difference]: Without dead ends: 52 [2022-07-20 06:21:01,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:21:01,439 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:01,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:21:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-20 06:21:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-20 06:21:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 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-20 06:21:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-20 06:21:01,440 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2022-07-20 06:21:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:01,441 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-20 06:21:01,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-20 06:21:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:21:01,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:01,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:01,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:21:01,655 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2022-07-20 06:21:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689694189] [2022-07-20 06:21:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:01,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689694189] [2022-07-20 06:21:01,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689694189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:01,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:01,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:21:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005572280] [2022-07-20 06:21:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:21:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:21:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:01,716 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:01,818 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-07-20 06:21:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:21:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:21:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:01,818 INFO L225 Difference]: With dead ends: 60 [2022-07-20 06:21:01,818 INFO L226 Difference]: Without dead ends: 60 [2022-07-20 06:21:01,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:21:01,819 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:01,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:21:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-20 06:21:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-07-20 06:21:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-20 06:21:01,821 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2022-07-20 06:21:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:01,821 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-20 06:21:01,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-20 06:21:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:21:01,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:01,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:01,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 06:21:01,822 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2022-07-20 06:21:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853619724] [2022-07-20 06:21:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853619724] [2022-07-20 06:21:01,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853619724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:01,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:01,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:21:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044956666] [2022-07-20 06:21:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:01,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:21:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:21:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:01,864 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:01,924 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-20 06:21:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:21:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:21:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:01,925 INFO L225 Difference]: With dead ends: 57 [2022-07-20 06:21:01,925 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 06:21:01,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:21:01,926 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:01,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:21:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 06:21:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-07-20 06:21:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 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-20 06:21:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-07-20 06:21:01,928 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2022-07-20 06:21:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:01,928 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-07-20 06:21:01,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-07-20 06:21:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:21:01,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:01,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:01,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:21:01,929 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2022-07-20 06:21:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:01,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294492751] [2022-07-20 06:21:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:21:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:01,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294492751] [2022-07-20 06:21:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294492751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:01,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:01,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:21:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005086085] [2022-07-20 06:21:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:21:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:21:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:01,982 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:02,064 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-07-20 06:21:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:21:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 42 [2022-07-20 06:21:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:02,065 INFO L225 Difference]: With dead ends: 55 [2022-07-20 06:21:02,065 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 06:21:02,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:21:02,066 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:02,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:21:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 06:21:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-20 06:21:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-20 06:21:02,068 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2022-07-20 06:21:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:02,068 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-20 06:21:02,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-20 06:21:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:21:02,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:02,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:02,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:21:02,069 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:21:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2022-07-20 06:21:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:21:02,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918370103] [2022-07-20 06:21:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:21:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:21:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:21:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918370103] [2022-07-20 06:21:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918370103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648785961] [2022-07-20 06:21:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:02,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:21:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:21:02,382 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:21:02,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:21:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:02,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-20 06:21:02,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:02,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:02,551 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:21:02,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:21:02,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:21:02,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:02,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:21:02,582 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:02,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 06:21:02,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:02,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:21:02,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:02,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-20 06:21:02,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:02,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-20 06:21:02,844 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-20 06:21:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:21:02,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:05,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-07-20 06:21:05,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-07-20 06:21:05,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2022-07-20 06:21:05,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-07-20 06:21:05,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-07-20 06:21:05,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2022-07-20 06:21:05,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-07-20 06:21:05,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-07-20 06:21:05,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:05,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2022-07-20 06:21:05,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_4) 4))))))) is different from false [2022-07-20 06:21:05,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_4) 4))))))) is different from false [2022-07-20 06:21:05,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:05,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:05,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2022-07-20 06:21:05,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 277 [2022-07-20 06:21:05,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:05,296 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 299 treesize of output 277 [2022-07-20 06:21:05,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 244 [2022-07-20 06:21:05,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:05,308 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 266 treesize of output 249 [2022-07-20 06:21:05,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:05,355 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-20 06:21:05,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-20 06:21:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-20 06:21:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648785961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:21:05,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:21:05,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 42 [2022-07-20 06:21:05,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540906861] [2022-07-20 06:21:05,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:05,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 06:21:05,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:21:05,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 06:21:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=960, Unknown=10, NotChecked=710, Total=1806 [2022-07-20 06:21:05,407 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:21:07,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-20 06:21:09,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-07-20 06:21:13,690 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |c_#valid| .cse1) 1))) is different from false [2022-07-20 06:21:52,306 WARN L233 SmtUtils]: Spent 24.04s on a formula simplification. DAG size of input: 45 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:21:59,368 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-07-20 06:21:59,639 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2022-07-20 06:22:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:02,285 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-20 06:22:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:22:02,286 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 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 45 [2022-07-20 06:22:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:02,286 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:22:02,286 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:22:02,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=220, Invalid=1525, Unknown=37, NotChecked=1410, Total=3192 [2022-07-20 06:22:02,287 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 59 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:02,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 211 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 500 Invalid, 0 Unknown, 559 Unchecked, 0.2s Time] [2022-07-20 06:22:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:22:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-07-20 06:22:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-07-20 06:22:02,289 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2022-07-20 06:22:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:02,289 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-07-20 06:22:02,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-07-20 06:22:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:22:02,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:02,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:02,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:02,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:22:02,502 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2022-07-20 06:22:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:22:02,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935729986] [2022-07-20 06:22:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:22:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:22:02,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:22:02,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935729986] [2022-07-20 06:22:02,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935729986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:22:02,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001822678] [2022-07-20 06:22:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:02,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:22:02,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:22:02,969 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:22:02,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:22:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:03,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-20 06:22:03,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:03,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:03,184 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:22:03,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:22:03,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:03,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:03,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:03,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:03,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:03,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:03,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:03,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 06:22:03,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 06:22:03,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:03,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:22:03,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:22:03,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:03,479 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-20 06:22:03,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:03,483 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 29 treesize of output 24 [2022-07-20 06:22:03,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:03,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-20 06:22:03,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:03,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-20 06:22:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:03,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:06,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2022-07-20 06:22:06,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) is different from false [2022-07-20 06:22:06,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) is different from false [2022-07-20 06:22:06,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2022-07-20 06:22:06,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2022-07-20 06:22:06,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2022-07-20 06:22:06,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))))) is different from false [2022-07-20 06:22:06,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2022-07-20 06:22:06,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:06,256 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 87 treesize of output 91 [2022-07-20 06:22:06,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1778 Int) (v_prenex_6 (Array Int Int))) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1777)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_8) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) is different from false [2022-07-20 06:22:06,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int) (v_ArrVal_1769 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1778 Int) (v_prenex_6 (Array Int Int))) (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1777)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_8 Int) (v_prenex_7 (Array Int Int))) (<= (select (store (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_8) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4))))))) is different from false [2022-07-20 06:22:06,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:06,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:06,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 63 [2022-07-20 06:22:06,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:06,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:06,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2022-07-20 06:22:06,403 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 66 treesize of output 54 [2022-07-20 06:22:06,406 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 230 treesize of output 222 [2022-07-20 06:22:06,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:06,414 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 258 treesize of output 258 [2022-07-20 06:22:06,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 218 [2022-07-20 06:22:06,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 314 [2022-07-20 06:22:06,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 234 [2022-07-20 06:22:06,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:06,512 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-20 06:22:06,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-07-20 06:22:06,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:06,517 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-20 06:22:06,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-07-20 06:22:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-20 06:22:06,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001822678] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:06,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:22:06,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 51 [2022-07-20 06:22:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458316743] [2022-07-20 06:22:06,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:06,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-20 06:22:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:22:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-20 06:22:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1588, Unknown=10, NotChecked=890, Total=2652 [2022-07-20 06:22:06,659 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:07,753 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-07-20 06:22:08,161 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))))) is different from false [2022-07-20 06:22:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:08,562 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-20 06:22:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:22:08,563 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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 45 [2022-07-20 06:22:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:08,563 INFO L225 Difference]: With dead ends: 66 [2022-07-20 06:22:08,563 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 06:22:08,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=348, Invalid=2658, Unknown=12, NotChecked=1404, Total=4422 [2022-07-20 06:22:08,564 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 258 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:08,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 270 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 598 Invalid, 0 Unknown, 663 Unchecked, 0.3s Time] [2022-07-20 06:22:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 06:22:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-07-20 06:22:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-20 06:22:08,566 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2022-07-20 06:22:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:08,566 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-20 06:22:08,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-20 06:22:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:22:08,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:08,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:08,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:08,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:22:08,784 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2022-07-20 06:22:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:22:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740963987] [2022-07-20 06:22:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:22:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:22:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:22:09,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740963987] [2022-07-20 06:22:09,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740963987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:22:09,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326843419] [2022-07-20 06:22:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:22:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:22:09,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:22:09,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 06:22:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:09,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-20 06:22:09,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:09,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:09,275 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:22:09,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:22:09,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:09,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:09,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2022-07-20 06:22:09,321 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:09,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-20 06:22:09,458 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:09,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:22:09,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:09,495 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 28 treesize of output 23 [2022-07-20 06:22:09,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:09,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 06:22:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:09,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:09,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:09,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)))) is different from false [2022-07-20 06:22:10,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1905 (Array Int Int))) (or (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1905))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1907)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-20 06:22:10,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1904 Int) (v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1905 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1904)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1905))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1907)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)))) is different from false [2022-07-20 06:22:10,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:10,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:10,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2022-07-20 06:22:10,081 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 171 treesize of output 159 [2022-07-20 06:22:10,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:10,089 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 161 treesize of output 154 [2022-07-20 06:22:10,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:10,098 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 163 treesize of output 151 [2022-07-20 06:22:10,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2022-07-20 06:22:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-20 06:22:10,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326843419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:10,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:22:10,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 22] total 44 [2022-07-20 06:22:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363956515] [2022-07-20 06:22:10,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:10,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 06:22:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:22:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 06:22:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1019, Unknown=10, NotChecked=730, Total=1892 [2022-07-20 06:22:10,231 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:13,917 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-07-20 06:22:14,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))))) is different from false [2022-07-20 06:22:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:14,443 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-07-20 06:22:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:22:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 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 46 [2022-07-20 06:22:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:14,444 INFO L225 Difference]: With dead ends: 63 [2022-07-20 06:22:14,444 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 06:22:14,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=313, Invalid=1979, Unknown=12, NotChecked=1236, Total=3540 [2022-07-20 06:22:14,445 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 78 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:14,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 375 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 475 Invalid, 0 Unknown, 523 Unchecked, 0.2s Time] [2022-07-20 06:22:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 06:22:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-20 06:22:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-20 06:22:14,447 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 46 [2022-07-20 06:22:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:14,447 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-20 06:22:14,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-20 06:22:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:22:14,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:14,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:14,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:14,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 06:22:14,664 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1223965472, now seen corresponding path program 1 times [2022-07-20 06:22:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:22:14,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57176240] [2022-07-20 06:22:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:22:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:22:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:22:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57176240] [2022-07-20 06:22:14,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57176240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:22:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842437954] [2022-07-20 06:22:14,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:14,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:22:14,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:22:14,974 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:22:14,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 06:22:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:15,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-20 06:22:15,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:15,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:15,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:22:15,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:22:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:15,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:15,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:15,285 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:15,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-07-20 06:22:15,542 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:15,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-20 06:22:15,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:15,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:15,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-20 06:22:15,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:15,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:22:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:15,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:16,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2022-07-20 06:22:16,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2022-07-20 06:22:16,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2033))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2034)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2033))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2034)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:22:16,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:16,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:16,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 48 [2022-07-20 06:22:16,415 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 312 treesize of output 292 [2022-07-20 06:22:16,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:16,424 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 300 treesize of output 282 [2022-07-20 06:22:16,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 312 [2022-07-20 06:22:16,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:16,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:16,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 352 treesize of output 336 [2022-07-20 06:22:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-20 06:22:16,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842437954] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:16,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:22:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 54 [2022-07-20 06:22:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906568275] [2022-07-20 06:22:16,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:16,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-20 06:22:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:22:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-20 06:22:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1820, Unknown=10, NotChecked=950, Total=2970 [2022-07-20 06:22:16,892 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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-20 06:22:18,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_2035 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select .cse1 8) 0)))) is different from false [2022-07-20 06:22:18,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_2035 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select .cse1 8) 0)))) is different from false [2022-07-20 06:22:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:19,285 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-07-20 06:22:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:22:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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) Word has length 48 [2022-07-20 06:22:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:19,286 INFO L225 Difference]: With dead ends: 73 [2022-07-20 06:22:19,286 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 06:22:19,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=367, Invalid=3329, Unknown=12, NotChecked=1548, Total=5256 [2022-07-20 06:22:19,288 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 81 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:19,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 402 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 615 Invalid, 0 Unknown, 605 Unchecked, 0.3s Time] [2022-07-20 06:22:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 06:22:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-07-20 06:22:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-07-20 06:22:19,290 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 48 [2022-07-20 06:22:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:19,290 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-07-20 06:22:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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-20 06:22:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-07-20 06:22:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:22:19,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:19,291 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:19,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:19,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-20 06:22:19,509 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1116795216, now seen corresponding path program 2 times [2022-07-20 06:22:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:22:19,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910179792] [2022-07-20 06:22:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:22:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:22:20,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910179792] [2022-07-20 06:22:20,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910179792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:22:20,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340466275] [2022-07-20 06:22:20,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:22:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:22:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:22:20,137 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:22:20,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 06:22:20,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:22:20,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:22:20,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 06:22:20,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:20,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:20,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:20,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:20,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:20,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:20,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:20,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:20,336 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:22:20,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:22:20,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:22:20,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:22:20,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:22:20,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:22:20,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:20,424 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 06:22:20,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:20,428 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 06:22:20,474 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:22:20,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2022-07-20 06:22:20,476 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 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-20 06:22:20,795 INFO L356 Elim1Store]: treesize reduction 84, result has 37.3 percent of original size [2022-07-20 06:22:20,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 88 [2022-07-20 06:22:20,840 INFO L356 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2022-07-20 06:22:20,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2022-07-20 06:22:21,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:21,285 INFO L356 Elim1Store]: treesize reduction 98, result has 33.8 percent of original size [2022-07-20 06:22:21,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 132 treesize of output 147 [2022-07-20 06:22:21,314 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-07-20 06:22:21,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 153 treesize of output 174 [2022-07-20 06:22:21,327 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:22:21,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:21,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 06:22:21,532 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 06:22:21,533 INFO L158 Benchmark]: Toolchain (without parser) took 91203.04ms. Allocated memory was 140.5MB in the beginning and 281.0MB in the end (delta: 140.5MB). Free memory was 106.7MB in the beginning and 191.1MB in the end (delta: -84.4MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2022-07-20 06:22:21,533 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:22:21,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.84ms. Allocated memory is still 140.5MB. Free memory was 106.7MB in the beginning and 106.5MB in the end (delta: 204.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 06:22:21,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.84ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:22:21,534 INFO L158 Benchmark]: Boogie Preprocessor took 43.33ms. Allocated memory is still 140.5MB. Free memory was 104.5MB in the beginning and 102.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:22:21,534 INFO L158 Benchmark]: RCFGBuilder took 376.05ms. Allocated memory is still 140.5MB. Free memory was 102.8MB in the beginning and 87.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-20 06:22:21,534 INFO L158 Benchmark]: TraceAbstraction took 90341.38ms. Allocated memory was 140.5MB in the beginning and 281.0MB in the end (delta: 140.5MB). Free memory was 86.7MB in the beginning and 191.1MB in the end (delta: -104.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-07-20 06:22:21,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.84ms. Allocated memory is still 140.5MB. Free memory was 106.7MB in the beginning and 106.5MB in the end (delta: 204.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.84ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.33ms. Allocated memory is still 140.5MB. Free memory was 104.5MB in the beginning and 102.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.05ms. Allocated memory is still 140.5MB. Free memory was 102.8MB in the beginning and 87.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 90341.38ms. Allocated memory was 140.5MB in the beginning and 281.0MB in the end (delta: 140.5MB). Free memory was 86.7MB in the beginning and 191.1MB in the end (delta: -104.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:22:21,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:22:23,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:22:23,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:22:23,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:22:23,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:22:23,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:22:23,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:22:23,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:22:23,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:22:23,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:22:23,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:22:23,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:22:23,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:22:23,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:22:23,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:22:23,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:22:23,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:22:23,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:22:23,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:22:23,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:22:23,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:22:23,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:22:23,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:22:23,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:22:23,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:22:23,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:22:23,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:22:23,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:22:23,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:22:23,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:22:23,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:22:23,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:22:23,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:22:23,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:22:23,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:22:23,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:22:23,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:22:23,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:22:23,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:22:23,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:22:23,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:22:23,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:22:23,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:22:23,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:22:23,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:22:23,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:22:23,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:22:23,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:22:23,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:22:23,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:22:23,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:22:23,280 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:22:23,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:22:23,281 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:22:23,281 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:22:23,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:22:23,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:22:23,282 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:22:23,283 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:22:23,283 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:22:23,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:22:23,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:22:23,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:22:23,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:22:23,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:22:23,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:22:23,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:22:23,284 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:22:23,284 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:22:23,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:22:23,285 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2022-07-20 06:22:23,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:22:23,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:22:23,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:22:23,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:22:23,572 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:22:23,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-20 06:22:23,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908999099/42f390031ec447c1b9bab8c56ba570ec/FLAG56b3b526d [2022-07-20 06:22:24,007 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:22:24,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-20 06:22:24,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908999099/42f390031ec447c1b9bab8c56ba570ec/FLAG56b3b526d [2022-07-20 06:22:24,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908999099/42f390031ec447c1b9bab8c56ba570ec [2022-07-20 06:22:24,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:22:24,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:22:24,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:22:24,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:22:24,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:22:24,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314282de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24, skipping insertion in model container [2022-07-20 06:22:24,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:22:24,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:22:24,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-20 06:22:24,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:22:24,330 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:22:24,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-20 06:22:24,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:22:24,407 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:22:24,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24 WrapperNode [2022-07-20 06:22:24,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:22:24,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:22:24,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:22:24,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:22:24,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,465 INFO L137 Inliner]: procedures = 129, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-07-20 06:22:24,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:22:24,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:22:24,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:22:24,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:22:24,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:22:24,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:22:24,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:22:24,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:22:24,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (1/1) ... [2022-07-20 06:22:24,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:22:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:22:24,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:22:24,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:22:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 06:22:24,579 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 06:22:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:22:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:22:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:22:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:22:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:22:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:22:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:22:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:22:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:22:24,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:22:24,653 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:22:24,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:22:24,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 06:22:24,966 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:22:24,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:22:24,970 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-20 06:22:24,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:24 BoogieIcfgContainer [2022-07-20 06:22:24,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:22:24,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:22:24,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:22:24,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:22:24,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:22:24" (1/3) ... [2022-07-20 06:22:24,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1249caa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:24, skipping insertion in model container [2022-07-20 06:22:24,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:24" (2/3) ... [2022-07-20 06:22:24,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1249caa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:24, skipping insertion in model container [2022-07-20 06:22:24,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:24" (3/3) ... [2022-07-20 06:22:24,977 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2022-07-20 06:22:24,986 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:22:24,986 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-20 06:22:25,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:22:25,023 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@5bff9398, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ca115d7 [2022-07-20 06:22:25,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-20 06:22:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:22:25,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:25,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:22:25,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-20 06:22:25,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:25,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108907743] [2022-07-20 06:22:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:25,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:25,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:25,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 06:22:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:25,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:22:25,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:25,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:25,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:25,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:25,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108907743] [2022-07-20 06:22:25,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108907743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:25,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:25,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:22:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525016961] [2022-07-20 06:22:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:22:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:22:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:25,204 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:25,333 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-07-20 06:22:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:22:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:22:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:25,342 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:22:25,342 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:22:25,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:25,346 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:25,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:22:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:22:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-20 06:22:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-20 06:22:25,379 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-07-20 06:22:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:25,379 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-20 06:22:25,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-20 06:22:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:22:25,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:25,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:22:25,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 06:22:25,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:25,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-20 06:22:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:25,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126354089] [2022-07-20 06:22:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:25,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 06:22:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:25,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:22:25,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:25,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:25,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:25,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:25,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126354089] [2022-07-20 06:22:25,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126354089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:25,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:25,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:22:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119364061] [2022-07-20 06:22:25,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:22:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:25,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:22:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:25,650 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:25,741 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-20 06:22:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:22:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:22:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:25,742 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:22:25,742 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:22:25,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:25,744 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:25,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:22:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:22:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-07-20 06:22:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-07-20 06:22:25,751 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-07-20 06:22:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:25,751 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-07-20 06:22:25,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-07-20 06:22:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:22:25,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:25,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:25,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:25,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-07-20 06:22:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313281184] [2022-07-20 06:22:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:25,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:25,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:25,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 06:22:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:25,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:22:25,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:26,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:26,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313281184] [2022-07-20 06:22:26,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313281184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:26,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:26,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:22:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919371071] [2022-07-20 06:22:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:26,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:22:26,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:22:26,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:26,011 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:26,020 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-07-20 06:22:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:22:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:22:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:26,021 INFO L225 Difference]: With dead ends: 66 [2022-07-20 06:22:26,021 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 06:22:26,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:26,022 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:26,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 06:22:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-07-20 06:22:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-07-20 06:22:26,026 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-07-20 06:22:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:26,026 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-07-20 06:22:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-07-20 06:22:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:22:26,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:26,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:26,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:26,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-20 06:22:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:26,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719379699] [2022-07-20 06:22:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:26,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:26,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:26,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 06:22:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:26,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:22:26,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:26,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:26,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719379699] [2022-07-20 06:22:26,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719379699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:26,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:26,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:22:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881763122] [2022-07-20 06:22:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:26,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:22:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:22:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:26,333 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:26,356 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-20 06:22:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:22:26,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:22:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:26,358 INFO L225 Difference]: With dead ends: 63 [2022-07-20 06:22:26,358 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 06:22:26,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:22:26,359 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:26,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 06:22:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-20 06:22:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-20 06:22:26,362 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-07-20 06:22:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:26,363 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-20 06:22:26,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-20 06:22:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:22:26,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:26,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:26,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:26,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:26,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-07-20 06:22:26,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:26,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12690690] [2022-07-20 06:22:26,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:26,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:26,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:26,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 06:22:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:26,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:22:26,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:26,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:26,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:26,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12690690] [2022-07-20 06:22:26,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12690690] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:26,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:26,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 06:22:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797383987] [2022-07-20 06:22:26,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:26,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:22:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:22:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:22:26,706 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:26,722 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-07-20 06:22:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:22:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 06:22:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:26,723 INFO L225 Difference]: With dead ends: 73 [2022-07-20 06:22:26,723 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 06:22:26,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:22:26,724 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:26,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 239 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 06:22:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-07-20 06:22:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-20 06:22:26,727 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-07-20 06:22:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:26,727 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-20 06:22:26,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-20 06:22:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:22:26,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:26,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:26,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:26,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:26,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-20 06:22:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:26,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235745004] [2022-07-20 06:22:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:26,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:26,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 06:22:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:27,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:22:27,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:27,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:27,071 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:22:27,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-20 06:22:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:27,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:27,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235745004] [2022-07-20 06:22:27,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235745004] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:27,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:27,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-20 06:22:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923128144] [2022-07-20 06:22:27,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:22:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:27,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:22:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:22:27,142 INFO L87 Difference]: Start difference. First operand 64 states and 70 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-20 06:22:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:27,257 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-07-20 06:22:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:22:27,258 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 16 [2022-07-20 06:22:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:27,258 INFO L225 Difference]: With dead ends: 77 [2022-07-20 06:22:27,258 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 06:22:27,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:22:27,259 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:27,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:22:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 06:22:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-20 06:22:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-20 06:22:27,262 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-07-20 06:22:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:27,262 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-20 06:22:27,262 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-20 06:22:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-20 06:22:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:22:27,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:27,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:27,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:27,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:27,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-20 06:22:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:27,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143589024] [2022-07-20 06:22:27,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:27,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:27,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 06:22:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:27,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:22:27,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:27,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:27,641 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:27,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:22:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:27,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:27,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143589024] [2022-07-20 06:22:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143589024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:27,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:27,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2022-07-20 06:22:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926258368] [2022-07-20 06:22:27,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:27,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:22:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:22:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:22:27,892 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:28,014 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-20 06:22:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:22:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:22:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:28,015 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:22:28,015 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:22:28,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:22:28,016 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:28,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 42 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 11 Unchecked, 0.1s Time] [2022-07-20 06:22:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:22:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-20 06:22:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-20 06:22:28,018 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-07-20 06:22:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-20 06:22:28,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-20 06:22:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:22:28,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:28,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:28,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:28,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:28,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-07-20 06:22:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:28,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851799941] [2022-07-20 06:22:28,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:22:28,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:28,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:28,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:28,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 06:22:28,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:22:28,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:22:28,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:22:28,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:28,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:28,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:28,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851799941] [2022-07-20 06:22:28,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851799941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:28,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:28,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-20 06:22:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399748641] [2022-07-20 06:22:28,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:22:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:22:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:22:28,387 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:28,438 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-07-20 06:22:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:22:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:22:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:28,439 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:22:28,439 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:22:28,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:22:28,439 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:28,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:22:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-20 06:22:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-20 06:22:28,442 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2022-07-20 06:22:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:28,442 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-20 06:22:28,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-20 06:22:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:22:28,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:28,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:28,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:28,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:28,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2022-07-20 06:22:28,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:28,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822552823] [2022-07-20 06:22:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:28,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:28,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:28,652 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:28,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 06:22:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:28,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:22:28,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:28,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:28,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:28,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822552823] [2022-07-20 06:22:28,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822552823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:28,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:28,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:22:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767853614] [2022-07-20 06:22:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:28,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:22:28,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:22:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:22:28,776 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:22:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:29,051 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-20 06:22:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:22:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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 23 [2022-07-20 06:22:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:29,053 INFO L225 Difference]: With dead ends: 113 [2022-07-20 06:22:29,053 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 06:22:29,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:22:29,053 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 258 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:29,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 123 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:22:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 06:22:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-07-20 06:22:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-20 06:22:29,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2022-07-20 06:22:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:29,057 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-20 06:22:29,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:22:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-20 06:22:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:22:29,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:29,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:29,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:29,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:29,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:29,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2022-07-20 06:22:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:29,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939974300] [2022-07-20 06:22:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:29,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:29,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:29,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 06:22:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:29,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:22:29,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:29,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:29,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:29,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:29,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939974300] [2022-07-20 06:22:29,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939974300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:29,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:29,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:22:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745971322] [2022-07-20 06:22:29,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:29,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:22:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:29,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:22:29,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:22:29,478 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:22:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:29,762 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-20 06:22:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:22:29,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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 23 [2022-07-20 06:22:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:29,768 INFO L225 Difference]: With dead ends: 100 [2022-07-20 06:22:29,768 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 06:22:29,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:22:29,769 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:29,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:22:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 06:22:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2022-07-20 06:22:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-20 06:22:29,778 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2022-07-20 06:22:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:29,779 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-20 06:22:29,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-20 06:22:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-20 06:22:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:22:29,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:29,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:29,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:29,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-07-20 06:22:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744083784] [2022-07-20 06:22:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:29,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:29,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:29,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:29,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 06:22:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:30,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:22:30,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:22:30,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:30,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744083784] [2022-07-20 06:22:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744083784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:30,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:30,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:22:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111749771] [2022-07-20 06:22:30,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:30,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:22:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:22:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:22:30,129 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:30,143 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-20 06:22:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:22:30,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-20 06:22:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:30,145 INFO L225 Difference]: With dead ends: 65 [2022-07-20 06:22:30,145 INFO L226 Difference]: Without dead ends: 65 [2022-07-20 06:22:30,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:22:30,146 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:30,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-20 06:22:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-07-20 06:22:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-07-20 06:22:30,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2022-07-20 06:22:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:30,159 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-07-20 06:22:30,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-07-20 06:22:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:22:30,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:30,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:30,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-20 06:22:30,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:30,370 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2022-07-20 06:22:30,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:30,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926519838] [2022-07-20 06:22:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:30,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:30,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:30,372 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:30,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 06:22:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:30,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:22:30,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:22:30,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:22:30,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:30,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926519838] [2022-07-20 06:22:30,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926519838] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:30,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:30,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-20 06:22:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566750674] [2022-07-20 06:22:30,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:30,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:22:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:30,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:22:30,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:22:30,607 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-20 06:22:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:30,829 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-07-20 06:22:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:22:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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 26 [2022-07-20 06:22:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:30,829 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:22:30,830 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 06:22:30,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:22:30,830 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 397 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:30,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:22:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 06:22:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 64. [2022-07-20 06:22:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-07-20 06:22:30,832 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 26 [2022-07-20 06:22:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:30,832 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-07-20 06:22:30,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-20 06:22:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-07-20 06:22:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:22:30,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:30,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:30,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:31,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:31,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2022-07-20 06:22:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478887107] [2022-07-20 06:22:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:31,041 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:31,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 06:22:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:31,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:22:31,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:31,168 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:22:31,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-20 06:22:31,235 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-20 06:22:31,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 29 [2022-07-20 06:22:31,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:31,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:31,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 06:22:31,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:22:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:31,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:31,622 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-20 06:22:31,623 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 21 treesize of output 20 [2022-07-20 06:22:31,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-20 06:22:31,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (_ BitVec 32)) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_406)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-20 06:22:31,678 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:22:31,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-20 06:22:31,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-20 06:22:31,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:22:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:22:31,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478887107] [2022-07-20 06:22:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478887107] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:31,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-07-20 06:22:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99928914] [2022-07-20 06:22:31,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:31,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:22:31,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:31,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:22:31,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=413, Unknown=2, NotChecked=82, Total=552 [2022-07-20 06:22:31,774 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:32,943 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-07-20 06:22:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:22:32,944 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:22:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:32,944 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:22:32,944 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:22:32,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1063, Unknown=2, NotChecked=138, Total=1406 [2022-07-20 06:22:32,945 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:32,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 380 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 444 Invalid, 0 Unknown, 113 Unchecked, 0.6s Time] [2022-07-20 06:22:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:22:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2022-07-20 06:22:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-20 06:22:32,947 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 26 [2022-07-20 06:22:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:32,947 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-20 06:22:32,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-20 06:22:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:22:32,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:32,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:32,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:33,148 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2022-07-20 06:22:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:33,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137578692] [2022-07-20 06:22:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:33,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:33,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:33,150 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:33,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 06:22:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:33,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:22:33,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:33,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:33,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:33,316 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:22:33,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:22:33,321 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-20 06:22:33,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:33,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:33,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:33,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:33,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:33,436 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:33,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 06:22:33,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 06:22:33,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 25 treesize of output 13 [2022-07-20 06:22:33,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:22:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:22:33,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:34,172 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 06:22:34,208 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_463)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (_ BitVec 32)) (v_ArrVal_463 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_463)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_464)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:22:34,235 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:22:34,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 44 [2022-07-20 06:22:34,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-07-20 06:22:34,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:22:34,276 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:22:34,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2022-07-20 06:22:34,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:34,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:34,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-07-20 06:22:34,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:34,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-20 06:22:34,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:34,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 06:22:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:22:41,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137578692] [2022-07-20 06:22:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137578692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:41,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:41,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2022-07-20 06:22:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200486170] [2022-07-20 06:22:41,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:41,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 06:22:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 06:22:41,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=453, Unknown=2, NotChecked=86, Total=600 [2022-07-20 06:22:41,894 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:45,445 INFO L93 Difference]: Finished difference Result 180 states and 193 transitions. [2022-07-20 06:22:45,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:22:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:22:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:45,447 INFO L225 Difference]: With dead ends: 180 [2022-07-20 06:22:45,447 INFO L226 Difference]: Without dead ends: 180 [2022-07-20 06:22:45,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=314, Invalid=1332, Unknown=2, NotChecked=158, Total=1806 [2022-07-20 06:22:45,448 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 720 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:45,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 436 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 611 Invalid, 0 Unknown, 331 Unchecked, 1.5s Time] [2022-07-20 06:22:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-20 06:22:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 90. [2022-07-20 06:22:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.2875) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-07-20 06:22:45,451 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2022-07-20 06:22:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:45,451 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-07-20 06:22:45,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-07-20 06:22:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:22:45,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:45,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:45,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:45,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:45,664 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2022-07-20 06:22:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:45,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264965697] [2022-07-20 06:22:45,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:22:45,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:45,666 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:45,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 06:22:45,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:22:45,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:22:45,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:22:45,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:45,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:22:45,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:45,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264965697] [2022-07-20 06:22:45,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264965697] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:45,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:45,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 06:22:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302909114] [2022-07-20 06:22:45,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:22:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:22:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:22:45,888 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:45,902 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-07-20 06:22:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:22:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:22:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:45,903 INFO L225 Difference]: With dead ends: 74 [2022-07-20 06:22:45,903 INFO L226 Difference]: Without dead ends: 74 [2022-07-20 06:22:45,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:22:45,903 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 101 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:45,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 141 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-20 06:22:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-20 06:22:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.3125) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-20 06:22:45,905 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 34 [2022-07-20 06:22:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:45,905 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-20 06:22:45,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-20 06:22:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:22:45,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:45,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:45,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:46,106 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash -674776798, now seen corresponding path program 1 times [2022-07-20 06:22:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:46,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160188779] [2022-07-20 06:22:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:46,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:46,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 06:22:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:46,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:22:46,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:46,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:46,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:46,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160188779] [2022-07-20 06:22:46,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160188779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:46,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:46,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 06:22:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044915458] [2022-07-20 06:22:46,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:46,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:22:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:22:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:22:46,310 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:46,345 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-07-20 06:22:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:22:46,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:22:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:46,346 INFO L225 Difference]: With dead ends: 79 [2022-07-20 06:22:46,346 INFO L226 Difference]: Without dead ends: 79 [2022-07-20 06:22:46,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:22:46,347 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 102 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:46,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-20 06:22:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-07-20 06:22:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.296875) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-20 06:22:46,349 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 34 [2022-07-20 06:22:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:46,349 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-20 06:22:46,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-20 06:22:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:22:46,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:46,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:46,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:46,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2022-07-20 06:22:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:46,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968850408] [2022-07-20 06:22:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:46,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:46,561 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:46,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:22:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:46,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:22:46,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:46,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:46,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:46,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968850408] [2022-07-20 06:22:46,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968850408] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:46,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:46,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-20 06:22:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562993870] [2022-07-20 06:22:46,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:22:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:22:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:22:46,819 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:46,896 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-20 06:22:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:22:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:22:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:46,897 INFO L225 Difference]: With dead ends: 52 [2022-07-20 06:22:46,897 INFO L226 Difference]: Without dead ends: 52 [2022-07-20 06:22:46,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:22:46,897 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:46,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 126 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:22:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-20 06:22:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-07-20 06:22:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-20 06:22:46,898 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 34 [2022-07-20 06:22:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:46,899 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-20 06:22:46,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-20 06:22:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:22:46,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:46,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:46,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:47,100 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash -427165146, now seen corresponding path program 2 times [2022-07-20 06:22:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100497269] [2022-07-20 06:22:47,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:22:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:47,102 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:47,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 06:22:47,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:22:47,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:22:47,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:22:47,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:47,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:47,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:47,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100497269] [2022-07-20 06:22:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100497269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:22:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454673357] [2022-07-20 06:22:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:22:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:22:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:22:47,264 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:47,473 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-20 06:22:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:22:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:22:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:47,474 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:22:47,474 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:22:47,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:22:47,475 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 110 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:47,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 61 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:22:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:22:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-20 06:22:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 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-20 06:22:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-20 06:22:47,477 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 39 [2022-07-20 06:22:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:47,477 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-20 06:22:47,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-20 06:22:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:22:47,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:47,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:47,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-20 06:22:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:47,686 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 1 times [2022-07-20 06:22:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:47,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651315258] [2022-07-20 06:22:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:47,687 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:47,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 06:22:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:47,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:22:47,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:47,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:47,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:47,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:47,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651315258] [2022-07-20 06:22:47,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651315258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:47,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:47,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:22:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123133694] [2022-07-20 06:22:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:47,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:22:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:47,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:22:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:22:47,924 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:48,154 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-07-20 06:22:48,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:22:48,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:22:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:48,154 INFO L225 Difference]: With dead ends: 60 [2022-07-20 06:22:48,154 INFO L226 Difference]: Without dead ends: 60 [2022-07-20 06:22:48,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:22:48,155 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:48,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:22:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-20 06:22:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-07-20 06:22:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-20 06:22:48,157 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2022-07-20 06:22:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:48,157 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-20 06:22:48,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-20 06:22:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:22:48,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:48,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:48,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:48,366 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2022-07-20 06:22:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:48,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461597766] [2022-07-20 06:22:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:48,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:48,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:48,368 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:48,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 06:22:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:48,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:22:48,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:22:48,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:48,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:48,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461597766] [2022-07-20 06:22:48,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461597766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:48,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:48,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:22:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407596131] [2022-07-20 06:22:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:48,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:22:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:22:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:22:48,524 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:48,680 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-20 06:22:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:22:48,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:22:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:48,680 INFO L225 Difference]: With dead ends: 57 [2022-07-20 06:22:48,680 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 06:22:48,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:22:48,681 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:48,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:22:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 06:22:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-07-20 06:22:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 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-20 06:22:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-07-20 06:22:48,683 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2022-07-20 06:22:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:48,683 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-07-20 06:22:48,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-07-20 06:22:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:22:48,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:48,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:48,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:48,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:48,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2022-07-20 06:22:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:48,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858733369] [2022-07-20 06:22:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:48,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:48,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:48,899 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:48,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 06:22:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:49,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:22:49,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:22:49,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:22:49,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:49,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858733369] [2022-07-20 06:22:49,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858733369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:22:49,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:22:49,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:22:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280898516] [2022-07-20 06:22:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:22:49,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:22:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:49,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:22:49,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:22:49,359 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:49,362 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-07-20 06:22:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:22:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 42 [2022-07-20 06:22:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:49,363 INFO L225 Difference]: With dead ends: 55 [2022-07-20 06:22:49,363 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 06:22:49,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:22:49,364 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:49,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-07-20 06:22:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 06:22:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-20 06:22:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-20 06:22:49,365 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2022-07-20 06:22:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:49,366 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-20 06:22:49,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-20 06:22:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:22:49,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:49,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:49,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:49,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:49,574 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2022-07-20 06:22:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:49,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262617197] [2022-07-20 06:22:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:49,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:49,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:49,576 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:49,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 06:22:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:49,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 06:22:49,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:49,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:49,824 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:22:49,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:22:49,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:49,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:49,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:49,897 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:49,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 06:22:50,088 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-20 06:22:50,122 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 29 treesize of output 24 [2022-07-20 06:22:50,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:22:50,221 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-20 06:22:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:22:50,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:50,514 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-20 06:22:50,529 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-20 06:22:50,539 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-20 06:22:50,554 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:22:50,564 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-07-20 06:22:50,573 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-07-20 06:22:50,587 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (_ bv1 1))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:22:50,766 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:22:50,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2022-07-20 06:22:50,779 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 287 treesize of output 233 [2022-07-20 06:22:50,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-20 06:22:50,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 06:22:50,798 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-20 06:22:50,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 1 [2022-07-20 06:22:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-07-20 06:22:50,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:50,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262617197] [2022-07-20 06:22:50,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262617197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:50,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:50,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 29 [2022-07-20 06:22:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697395424] [2022-07-20 06:22:50,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:50,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:22:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:22:50,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=447, Unknown=11, NotChecked=336, Total=870 [2022-07-20 06:22:50,844 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:22:51,865 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-20 06:22:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:22:51,866 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 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 45 [2022-07-20 06:22:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:22:51,866 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:22:51,866 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:22:51,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=861, Unknown=11, NotChecked=462, Total=1482 [2022-07-20 06:22:51,867 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:22:51,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 247 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 467 Invalid, 0 Unknown, 425 Unchecked, 0.6s Time] [2022-07-20 06:22:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:22:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-07-20 06:22:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-07-20 06:22:51,869 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2022-07-20 06:22:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:22:51,869 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-07-20 06:22:51,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:22:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-07-20 06:22:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:22:51,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:22:51,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:22:51,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:22:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:22:52,070 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:22:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:22:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2022-07-20 06:22:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:22:52,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806034110] [2022-07-20 06:22:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:22:52,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:22:52,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:22:52,072 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:22:52,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 06:22:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:22:52,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 06:22:52,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:22:52,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:52,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:22:52,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:22:52,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:22:52,381 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-20 06:22:52,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:52,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:22:52,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:52,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:52,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:52,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:22:52,482 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:52,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 06:22:52,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 22 treesize of output 24 [2022-07-20 06:22:52,735 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:22:52,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-20 06:22:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:22:52,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:22:52,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 06:22:52,803 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 29 treesize of output 24 [2022-07-20 06:22:52,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:22:52,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:22:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:22:52,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:22:53,825 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:22:53,859 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:22:53,884 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:22:53,920 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))) is different from false [2022-07-20 06:22:53,954 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1)))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-20 06:22:53,978 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))))))) is different from false [2022-07-20 06:22:54,013 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-20 06:22:54,105 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) .cse2 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2022-07-20 06:22:54,166 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1015 (_ BitVec 32)) (v_ArrVal_1016 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1015)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1016)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1021)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1015 (_ BitVec 32)) (v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1016 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_1016)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (bvule (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_1015)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) .cse4 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)))))))) is different from false [2022-07-20 06:22:54,209 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:22:54,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 100 [2022-07-20 06:22:54,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:54,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:54,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 70 [2022-07-20 06:22:54,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-07-20 06:22:54,233 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 174 treesize of output 144 [2022-07-20 06:22:54,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-07-20 06:22:54,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-07-20 06:22:54,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-07-20 06:22:54,305 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:22:54,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 115 [2022-07-20 06:22:54,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:54,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:22:54,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 70 [2022-07-20 06:22:54,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:54,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2022-07-20 06:22:54,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:22:54,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-07-20 06:22:54,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 06:22:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2022-07-20 06:22:58,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:22:58,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806034110] [2022-07-20 06:22:58,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806034110] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:22:58,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:22:58,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2022-07-20 06:22:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241728283] [2022-07-20 06:22:58,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:22:58,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:22:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:22:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:22:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=592, Unknown=9, NotChecked=504, Total=1190 [2022-07-20 06:22:58,845 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 35 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:03,195 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-20 06:23:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:23:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 35 states have internal predecessors, (83), 0 states have call successors, (0), 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 45 [2022-07-20 06:23:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:03,197 INFO L225 Difference]: With dead ends: 66 [2022-07-20 06:23:03,197 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 06:23:03,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=177, Invalid=1256, Unknown=9, NotChecked=720, Total=2162 [2022-07-20 06:23:03,198 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:03,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 473 Invalid, 0 Unknown, 582 Unchecked, 1.2s Time] [2022-07-20 06:23:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 06:23:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-07-20 06:23:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-20 06:23:03,199 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2022-07-20 06:23:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:03,200 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-20 06:23:03,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 35 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-20 06:23:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:23:03,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:03,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:03,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-20 06:23:03,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:03,407 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:23:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2022-07-20 06:23:03,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:03,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139957996] [2022-07-20 06:23:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:03,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:03,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:03,409 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:23:03,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 06:23:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:03,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 06:23:03,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:03,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:23:03,734 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:03,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:23:03,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:23:03,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:03,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:23:03,886 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:23:03,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-20 06:23:04,375 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:23:04,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:23:04,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-20 06:23:04,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 24 treesize of output 12 [2022-07-20 06:23:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:23:04,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:05,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-20 06:23:05,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-20 06:23:05,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-20 06:23:05,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-20 06:23:05,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-20 06:23:05,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-20 06:23:05,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-20 06:23:05,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1091)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) is different from false [2022-07-20 06:23:05,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1089 (_ BitVec 32)) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1089)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1091)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (_ bv0 32)))) is different from false [2022-07-20 06:23:05,191 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:23:05,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2022-07-20 06:23:05,196 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 167 treesize of output 131 [2022-07-20 06:23:05,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-20 06:23:05,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-20 06:23:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2022-07-20 06:23:05,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:05,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139957996] [2022-07-20 06:23:05,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139957996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:23:05,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:05,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 32 [2022-07-20 06:23:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382171177] [2022-07-20 06:23:05,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:23:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:23:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=455, Unknown=9, NotChecked=450, Total=992 [2022-07-20 06:23:05,559 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:07,738 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-07-20 06:23:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:23:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 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 46 [2022-07-20 06:23:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:07,739 INFO L225 Difference]: With dead ends: 63 [2022-07-20 06:23:07,739 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 06:23:07,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=1103, Unknown=10, NotChecked=684, Total=1980 [2022-07-20 06:23:07,740 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:07,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 309 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 350 Invalid, 0 Unknown, 464 Unchecked, 1.0s Time] [2022-07-20 06:23:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 06:23:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-20 06:23:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-20 06:23:07,741 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 46 [2022-07-20 06:23:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:07,741 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-20 06:23:07,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-20 06:23:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:23:07,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:07,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:07,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-20 06:23:07,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:07,942 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:23:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1223965472, now seen corresponding path program 1 times [2022-07-20 06:23:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138286985] [2022-07-20 06:23:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:07,944 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:23:07,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 06:23:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 06:23:08,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:08,259 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:23:08,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:23:08,456 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:23:08,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:23:08,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:23:08,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:08,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:23:08,716 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:23:08,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-20 06:23:09,408 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:23:09,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-20 06:23:09,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-20 06:23:09,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-20 06:23:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:23:10,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:11,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1159) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1158))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1159)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (_ BitVec 32))) (bvult (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1156)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1158))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1159)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:23:11,531 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:23:11,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 45 [2022-07-20 06:23:11,552 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 278 treesize of output 224 [2022-07-20 06:23:11,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 150 [2022-07-20 06:23:11,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 118 [2022-07-20 06:23:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-07-20 06:23:11,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138286985] [2022-07-20 06:23:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138286985] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:23:11,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:11,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 35 [2022-07-20 06:23:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568294746] [2022-07-20 06:23:11,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:11,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 06:23:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 06:23:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=672, Unknown=22, NotChecked=472, Total=1260 [2022-07-20 06:23:11,961 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:15,247 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-20 06:23:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:23:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-20 06:23:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:15,248 INFO L225 Difference]: With dead ends: 62 [2022-07-20 06:23:15,248 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 06:23:15,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=196, Invalid=1445, Unknown=31, NotChecked=680, Total=2352 [2022-07-20 06:23:15,249 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:15,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 305 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 410 Invalid, 0 Unknown, 493 Unchecked, 1.2s Time] [2022-07-20 06:23:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 06:23:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-07-20 06:23:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-07-20 06:23:15,251 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 48 [2022-07-20 06:23:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:15,251 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-07-20 06:23:15,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:23:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-07-20 06:23:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:23:15,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:15,252 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:15,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:15,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:15,461 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 06:23:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1116795216, now seen corresponding path program 2 times [2022-07-20 06:23:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41687934] [2022-07-20 06:23:15,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:23:15,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:15,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:15,463 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:23:15,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 06:23:15,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:23:15,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:23:15,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-20 06:23:15,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:15,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:23:15,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:23:15,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:23:15,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:15,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:23:15,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:15,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:23:16,005 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:16,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:23:16,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 16 treesize of output 18 [2022-07-20 06:23:16,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:23:16,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:23:16,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:23:16,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:16,219 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 06:23:16,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:16,240 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 06:23:16,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:16,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:23:16,302 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:23:16,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2022-07-20 06:23:16,308 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 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-20 06:23:17,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:23:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:17,054 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:23:17,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 67 [2022-07-20 06:23:17,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:23:17,084 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:23:17,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2022-07-20 06:23:17,260 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 06:23:17,268 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:23:17,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-07-20 06:23:17,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:23:17,948 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-20 06:23:17,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-07-20 06:23:17,966 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:23:17,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 06:23:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:23:18,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:46,924 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-20 06:24:46,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 853 treesize of output 590 [2022-07-20 06:24:46,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:47,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:47,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 573 treesize of output 470 [2022-07-20 06:24:47,514 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-20 06:24:47,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 853 treesize of output 670 [2022-07-20 06:24:47,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:24:47,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:47,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 653 treesize of output 470 [2022-07-20 06:25:13,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv0 1))) (and (forall ((v_ArrVal_1245 (_ BitVec 32)) (v_ArrVal_1247 (_ BitVec 32)) (v_ArrVal_1249 (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1242 (_ BitVec 32)) (v_ArrVal_1241 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 (_ bv4 32)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse7 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_14))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1241)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_13))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1242))))) (let ((.cse3 (select (select .cse2 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32))) (.cse4 (select (select .cse5 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32)))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_1247)))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|))) (select (store .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| (store .cse1 (_ bv0 32) v_ArrVal_1249)) (select .cse1 (_ bv4 32))))) (bvadd (select (select (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_1245)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32)) (_ bv4 32)))))) (_ bv0 32)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_14 (_ bv4 32)))))) (forall ((v_ArrVal_1245 (_ BitVec 32)) (v_ArrVal_1247 (_ BitVec 32)) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1250 (_ BitVec 32)) (v_ArrVal_1242 (_ BitVec 32)) (v_ArrVal_1241 (_ BitVec 32))) (or (= (let ((.cse16 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (let ((.cse14 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_15))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse16 v_ArrVal_1241)))) (.cse11 (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_16))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse16 v_ArrVal_1242))))) (let ((.cse12 (select (select .cse11 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32))) (.cse13 (select (select .cse14 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32)))) (let ((.cse9 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_1245)))) (let ((.cse10 (select .cse9 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|))) (select (select (store .cse9 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| (store .cse10 (_ bv0 32) v_ArrVal_1250)) (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_1247)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32))) (bvadd (_ bv4 32) (select .cse10 (_ bv4 32))))))))) (_ bv0 32)) (not (= (select v_arrayElimArr_15 (_ bv4 32)) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_16 (_ bv4 32)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) is different from false [2022-07-20 06:25:15,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv0 1))) (and (forall ((v_ArrVal_1245 (_ BitVec 32)) (v_ArrVal_1247 (_ BitVec 32)) (v_ArrVal_1249 (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1242 (_ BitVec 32)) (v_ArrVal_1241 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse7 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_14))) (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1241)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_13))) (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1242))))) (let ((.cse3 (select (select .cse2 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32))) (.cse4 (select (select .cse5 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32)))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_1247)))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|))) (select (store .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| (store .cse1 (_ bv0 32) v_ArrVal_1249)) (select .cse1 (_ bv4 32))))) (bvadd (_ bv4 32) (select (select (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_1245)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32)))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_13 (_ bv4 32)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_14 (_ bv4 32)))))) (forall ((v_ArrVal_1245 (_ BitVec 32)) (v_ArrVal_1247 (_ BitVec 32)) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1250 (_ BitVec 32)) (v_ArrVal_1242 (_ BitVec 32)) (v_ArrVal_1241 (_ BitVec 32))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (_ bv4 32)))) (= (let ((.cse16 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse14 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_15))) (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 v_ArrVal_1241)))) (.cse11 (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| v_arrayElimArr_16))) (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 v_ArrVal_1242))))) (let ((.cse12 (select (select .cse11 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32))) (.cse13 (select (select .cse14 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32)))) (let ((.cse9 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_1245)))) (let ((.cse10 (select .cse9 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|))) (select (select (store .cse9 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50| (store .cse10 (_ bv0 32) v_ArrVal_1250)) (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_1247)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_50|) (_ bv4 32))) (bvadd (select .cse10 (_ bv4 32)) (_ bv4 32)))))))) (_ bv0 32)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_15 (_ bv4 32))))))))) is different from false