./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 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_prepend_unequal.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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:54:02,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:54:02,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:54:02,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:54:02,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:54:02,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:54:02,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:54:02,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:54:02,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:54:02,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:54:02,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:54:02,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:54:02,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:54:02,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:54:02,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:54:02,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:54:02,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:54:02,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:54:02,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:54:02,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:54:02,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:54:02,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:54:02,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:54:02,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:54:02,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:54:02,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:54:02,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:54:02,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:54:02,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:54:02,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:54:02,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:54:02,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:54:02,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:54:02,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:54:02,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:54:02,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:54:02,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:54:02,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:54:02,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:54:02,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:54:02,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:54:02,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:54:02,390 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:54:02,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:54:02,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:54:02,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:54:02,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:54:02,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:54:02,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:54:02,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:54:02,393 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:54:02,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:54:02,394 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:54:02,395 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:54:02,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:54:02,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:54:02,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:54:02,395 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:54:02,396 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:54:02,396 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:54:02,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:54:02,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:54:02,396 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:54:02,397 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:54:02,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:54:02,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:54:02,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:54:02,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:54:02,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:54:02,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:54:02,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:54:02,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:54:02,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:54:02,399 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:54:02,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:54:02,400 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:54:02,400 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2023-02-14 13:54:02,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:54:02,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:54:02,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:54:02,685 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:54:02,686 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:54:02,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-02-14 13:54:03,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:54:04,134 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:54:04,135 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-02-14 13:54:04,154 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34456157a/e5578ec614884bebb1ed19b95e922ac9/FLAG29dde9461 [2023-02-14 13:54:04,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34456157a/e5578ec614884bebb1ed19b95e922ac9 [2023-02-14 13:54:04,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:54:04,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:54:04,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:54:04,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:54:04,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:54:04,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53500d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04, skipping insertion in model container [2023-02-14 13:54:04,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:54:04,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:54:04,531 WARN L237 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_prepend_unequal.i[24450,24463] [2023-02-14 13:54:04,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:54:04,549 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:54:04,603 WARN L237 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_prepend_unequal.i[24450,24463] [2023-02-14 13:54:04,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:54:04,627 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:54:04,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04 WrapperNode [2023-02-14 13:54:04,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:54:04,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:54:04,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:54:04,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:54:04,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,664 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2023-02-14 13:54:04,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:54:04,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:54:04,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:54:04,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:54:04,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,695 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:54:04,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:54:04,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:54:04,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:54:04,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (1/1) ... [2023-02-14 13:54:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:54:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:04,729 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) [2023-02-14 13:54:04,740 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 [2023-02-14 13:54:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-14 13:54:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-14 13:54:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:54:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:54:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:54:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:54:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:54:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:54:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:54:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:54:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:54:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:54:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:54:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:54:04,929 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:54:04,931 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:54:04,986 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-14 13:54:05,397 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:54:05,403 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:54:05,405 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 13:54:05,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:54:05 BoogieIcfgContainer [2023-02-14 13:54:05,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:54:05,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:54:05,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:54:05,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:54:05,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:54:04" (1/3) ... [2023-02-14 13:54:05,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f18742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:54:05, skipping insertion in model container [2023-02-14 13:54:05,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:54:04" (2/3) ... [2023-02-14 13:54:05,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f18742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:54:05, skipping insertion in model container [2023-02-14 13:54:05,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:54:05" (3/3) ... [2023-02-14 13:54:05,416 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2023-02-14 13:54:05,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:54:05,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-02-14 13:54:05,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:54:05,482 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57fa2206, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:54:05,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-02-14 13:54:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 54 states have (on average 2.074074074074074) internal successors, (112), 100 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:54:05,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:05,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:54:05,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2023-02-14 13:54:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:05,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942956219] [2023-02-14 13:54:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:05,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:05,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942956219] [2023-02-14 13:54:05,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942956219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:05,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:05,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:54:05,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703270961] [2023-02-14 13:54:05,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:05,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:05,770 INFO L87 Difference]: Start difference. First operand has 102 states, 54 states have (on average 2.074074074074074) internal successors, (112), 100 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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) [2023-02-14 13:54:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:05,979 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2023-02-14 13:54:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:05,981 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 [2023-02-14 13:54:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:05,988 INFO L225 Difference]: With dead ends: 177 [2023-02-14 13:54:05,988 INFO L226 Difference]: Without dead ends: 170 [2023-02-14 13:54:05,990 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 [2023-02-14 13:54:05,993 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 93 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:05,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 195 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:54:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-14 13:54:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 93. [2023-02-14 13:54:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2023-02-14 13:54:06,026 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 5 [2023-02-14 13:54:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:06,026 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2023-02-14 13:54:06,027 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) [2023-02-14 13:54:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2023-02-14 13:54:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:54:06,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:06,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:54:06,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:54:06,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2023-02-14 13:54:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523309322] [2023-02-14 13:54:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:06,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523309322] [2023-02-14 13:54:06,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523309322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:06,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:54:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982636245] [2023-02-14 13:54:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:06,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:06,156 INFO L87 Difference]: Start difference. First operand 93 states and 99 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) [2023-02-14 13:54:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:06,278 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2023-02-14 13:54:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:06,279 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 [2023-02-14 13:54:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:06,281 INFO L225 Difference]: With dead ends: 169 [2023-02-14 13:54:06,281 INFO L226 Difference]: Without dead ends: 169 [2023-02-14 13:54:06,281 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 [2023-02-14 13:54:06,283 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 91 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:06,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 189 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-14 13:54:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 90. [2023-02-14 13:54:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-14 13:54:06,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 5 [2023-02-14 13:54:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-14 13:54:06,292 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) [2023-02-14 13:54:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-14 13:54:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:54:06,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:06,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:06,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:54:06,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2023-02-14 13:54:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:06,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058909937] [2023-02-14 13:54:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:06,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058909937] [2023-02-14 13:54:06,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058909937] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:06,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:06,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:54:06,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191534100] [2023-02-14 13:54:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:06,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:06,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:06,340 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:06,348 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2023-02-14 13:54:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:06,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 13:54:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:06,349 INFO L225 Difference]: With dead ends: 100 [2023-02-14 13:54:06,349 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 13:54:06,350 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 [2023-02-14 13:54:06,351 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 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 [2023-02-14 13:54:06,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 13:54:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2023-02-14 13:54:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 90 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) [2023-02-14 13:54:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-02-14 13:54:06,358 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 7 [2023-02-14 13:54:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:06,358 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-02-14 13:54:06,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-02-14 13:54:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 13:54:06,359 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:06,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:06,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:54:06,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2023-02-14 13:54:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:06,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941747009] [2023-02-14 13:54:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941747009] [2023-02-14 13:54:06,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941747009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:06,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:06,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:54:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375348459] [2023-02-14 13:54:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:06,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:06,470 INFO L87 Difference]: Start difference. First operand 91 states and 97 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) [2023-02-14 13:54:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:06,483 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-02-14 13:54:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:06,484 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 [2023-02-14 13:54:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:06,485 INFO L225 Difference]: With dead ends: 97 [2023-02-14 13:54:06,485 INFO L226 Difference]: Without dead ends: 97 [2023-02-14 13:54:06,485 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 [2023-02-14 13:54:06,486 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 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 [2023-02-14 13:54:06,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-14 13:54:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-02-14 13:54:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-02-14 13:54:06,493 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 9 [2023-02-14 13:54:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:06,493 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-02-14 13:54:06,494 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) [2023-02-14 13:54:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-02-14 13:54:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:54:06,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:06,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:06,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:54:06,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2023-02-14 13:54:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010548593] [2023-02-14 13:54:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010548593] [2023-02-14 13:54:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010548593] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972968582] [2023-02-14 13:54:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:06,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:06,606 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) [2023-02-14 13:54:06,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 13:54:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:06,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:54:06,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:06,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:06,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972968582] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:54:06,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:54:06,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-14 13:54:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244377298] [2023-02-14 13:54:06,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:06,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:54:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:06,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:54:06,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:06,771 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:06,783 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-02-14 13:54:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:54:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 13:54:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:06,784 INFO L225 Difference]: With dead ends: 98 [2023-02-14 13:54:06,784 INFO L226 Difference]: Without dead ends: 98 [2023-02-14 13:54:06,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:06,786 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:06,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-14 13:54:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-14 13:54:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-02-14 13:54:06,791 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 14 [2023-02-14 13:54:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:06,796 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-02-14 13:54:06,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-02-14 13:54:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:54:06,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:06,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:06,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 13:54:07,025 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 [2023-02-14 13:54:07,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2023-02-14 13:54:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:07,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12514625] [2023-02-14 13:54:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12514625] [2023-02-14 13:54:07,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12514625] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549426946] [2023-02-14 13:54:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:07,259 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) [2023-02-14 13:54:07,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 13:54:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:07,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:54:07,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:07,391 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:07,422 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:54:07,422 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:07,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:07,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549426946] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:54:07,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:54:07,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-14 13:54:07,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29755133] [2023-02-14 13:54:07,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:07,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:54:07,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:07,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:54:07,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:54:07,600 INFO L87 Difference]: Start difference. First operand 98 states and 104 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) [2023-02-14 13:54:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:07,711 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2023-02-14 13:54:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:54:07,712 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 [2023-02-14 13:54:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:07,713 INFO L225 Difference]: With dead ends: 109 [2023-02-14 13:54:07,713 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 13:54:07,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:07,714 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 247 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:07,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 82 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 13:54:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2023-02-14 13:54:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 96 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) [2023-02-14 13:54:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-02-14 13:54:07,719 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 16 [2023-02-14 13:54:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:07,720 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-02-14 13:54:07,720 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) [2023-02-14 13:54:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-02-14 13:54:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:54:07,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:07,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:07,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:07,926 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 [2023-02-14 13:54:07,927 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:07,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2023-02-14 13:54:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:07,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478515910] [2023-02-14 13:54:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478515910] [2023-02-14 13:54:08,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478515910] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:08,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631180297] [2023-02-14 13:54:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:08,145 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) [2023-02-14 13:54:08,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 13:54:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:08,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 13:54:08,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:08,268 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:08,273 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:08,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:08,338 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:08,346 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:54:08,346 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:08,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:12,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631180297] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:54:12,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:54:12,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-02-14 13:54:12,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302362186] [2023-02-14 13:54:12,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:12,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 13:54:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 13:54:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:54:12,640 INFO L87 Difference]: Start difference. First operand 97 states and 103 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) [2023-02-14 13:54:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:12,786 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-14 13:54:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:54:12,786 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 [2023-02-14 13:54:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:12,787 INFO L225 Difference]: With dead ends: 108 [2023-02-14 13:54:12,787 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 13:54:12,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:54:12,788 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 532 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:12,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 56 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 13:54:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2023-02-14 13:54:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.728813559322034) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-02-14 13:54:12,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 16 [2023-02-14 13:54:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:12,793 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-02-14 13:54:12,793 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) [2023-02-14 13:54:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-02-14 13:54:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:54:12,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:12,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:12,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:12,999 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 [2023-02-14 13:54:13,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2023-02-14 13:54:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:13,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872623864] [2023-02-14 13:54:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872623864] [2023-02-14 13:54:13,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872623864] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:13,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363139781] [2023-02-14 13:54:13,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:54:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:13,052 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) [2023-02-14 13:54:13,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 13:54:13,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 13:54:13,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:54:13,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:54:13,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:13,138 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:13,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:54:13,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363139781] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:13,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:54:13,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-02-14 13:54:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285296417] [2023-02-14 13:54:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:13,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:13,151 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:13,207 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-14 13:54:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 13:54:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:13,208 INFO L225 Difference]: With dead ends: 105 [2023-02-14 13:54:13,208 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 13:54:13,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:13,209 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 73 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:13,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 13:54:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2023-02-14 13:54:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2023-02-14 13:54:13,220 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 21 [2023-02-14 13:54:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:13,221 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2023-02-14 13:54:13,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2023-02-14 13:54:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:54:13,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:13,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:13,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:13,428 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 [2023-02-14 13:54:13,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2023-02-14 13:54:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:13,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426725491] [2023-02-14 13:54:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:13,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426725491] [2023-02-14 13:54:13,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426725491] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:13,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104895564] [2023-02-14 13:54:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:13,481 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) [2023-02-14 13:54:13,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 13:54:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:13,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:54:13,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:13,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:13,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104895564] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:54:13,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:54:13,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-02-14 13:54:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844640935] [2023-02-14 13:54:13,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:13,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:54:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:13,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:54:13,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:54:13,627 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:13,652 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2023-02-14 13:54:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:54:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 13:54:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:13,653 INFO L225 Difference]: With dead ends: 93 [2023-02-14 13:54:13,653 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 13:54:13,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:13,654 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 165 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 87 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 [2023-02-14 13:54:13,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 13:54:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-14 13:54:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 92 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2023-02-14 13:54:13,658 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 21 [2023-02-14 13:54:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:13,658 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2023-02-14 13:54:13,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2023-02-14 13:54:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:54:13,659 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:13,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:13,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:13,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:13,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2023-02-14 13:54:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:13,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24381999] [2023-02-14 13:54:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:13,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24381999] [2023-02-14 13:54:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24381999] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:13,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:54:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104178551] [2023-02-14 13:54:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:13,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:54:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:54:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:54:13,971 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2023-02-14 13:54:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:14,018 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2023-02-14 13:54:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:54:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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 22 [2023-02-14 13:54:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:14,019 INFO L225 Difference]: With dead ends: 90 [2023-02-14 13:54:14,020 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 13:54:14,020 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 [2023-02-14 13:54:14,021 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 73 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:14,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 63 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 13:54:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-14 13:54:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-02-14 13:54:14,026 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 22 [2023-02-14 13:54:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:14,026 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-02-14 13:54:14,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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) [2023-02-14 13:54:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-02-14 13:54:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 13:54:14,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:14,027 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] [2023-02-14 13:54:14,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:54:14,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2023-02-14 13:54:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:14,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365643714] [2023-02-14 13:54:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365643714] [2023-02-14 13:54:14,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365643714] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648860319] [2023-02-14 13:54:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:14,265 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) [2023-02-14 13:54:14,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 13:54:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:14,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 13:54:14,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:14,413 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:14,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:14,426 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:14,449 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:14,449 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:14,491 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:14,492 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:54:14,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:54:14,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648860319] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:54:14,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:54:14,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2023-02-14 13:54:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325585180] [2023-02-14 13:54:14,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:54:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 13:54:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 13:54:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:54:14,612 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:14,711 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-02-14 13:54:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:54:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 27 [2023-02-14 13:54:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:14,713 INFO L225 Difference]: With dead ends: 96 [2023-02-14 13:54:14,713 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 13:54:14,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:54:14,714 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 129 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:14,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 84 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 13:54:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2023-02-14 13:54:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 83 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) [2023-02-14 13:54:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-14 13:54:14,716 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 27 [2023-02-14 13:54:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:14,716 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-14 13:54:14,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-14 13:54:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 13:54:14,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:14,717 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] [2023-02-14 13:54:14,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-14 13:54:14,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:14,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2023-02-14 13:54:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:14,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102082207] [2023-02-14 13:54:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102082207] [2023-02-14 13:54:15,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102082207] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:15,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084294923] [2023-02-14 13:54:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:15,289 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) [2023-02-14 13:54:15,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 13:54:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:15,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 13:54:15,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:15,426 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:15,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:15,442 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:15,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:15,482 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:15,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:15,555 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:15,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:54:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084294923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:15,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:54:15,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-02-14 13:54:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747036031] [2023-02-14 13:54:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:15,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:54:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:54:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:15,579 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:15,638 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-02-14 13:54:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:54:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 13:54:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:15,639 INFO L225 Difference]: With dead ends: 78 [2023-02-14 13:54:15,639 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 13:54:15,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:54:15,640 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:15,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 51 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 13:54:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-14 13:54:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 77 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) [2023-02-14 13:54:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-02-14 13:54:15,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 27 [2023-02-14 13:54:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:15,642 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-02-14 13:54:15,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-02-14 13:54:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 13:54:15,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:15,643 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] [2023-02-14 13:54:15,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 13:54:15,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:15,844 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 579705555, now seen corresponding path program 1 times [2023-02-14 13:54:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:15,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190350589] [2023-02-14 13:54:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:15,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:15,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190350589] [2023-02-14 13:54:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190350589] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:15,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:54:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513502350] [2023-02-14 13:54:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:54:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:54:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:15,921 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:15,996 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-14 13:54:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:54:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-14 13:54:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:15,997 INFO L225 Difference]: With dead ends: 89 [2023-02-14 13:54:15,997 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 13:54:15,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:54:15,998 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:15,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 88 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 13:54:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2023-02-14 13:54:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-02-14 13:54:16,000 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 28 [2023-02-14 13:54:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:16,000 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-02-14 13:54:16,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-02-14 13:54:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 13:54:16,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:16,001 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] [2023-02-14 13:54:16,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 13:54:16,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 579705556, now seen corresponding path program 1 times [2023-02-14 13:54:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:16,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499502291] [2023-02-14 13:54:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:16,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499502291] [2023-02-14 13:54:16,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499502291] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:16,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:16,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:54:16,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121975787] [2023-02-14 13:54:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:16,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:54:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:54:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:54:16,130 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:16,200 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-02-14 13:54:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:54:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-14 13:54:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:16,201 INFO L225 Difference]: With dead ends: 76 [2023-02-14 13:54:16,201 INFO L226 Difference]: Without dead ends: 76 [2023-02-14 13:54:16,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:54:16,202 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 164 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:16,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:54:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-14 13:54:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-14 13:54:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-02-14 13:54:16,204 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 28 [2023-02-14 13:54:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:16,204 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-02-14 13:54:16,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-02-14 13:54:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 13:54:16,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:16,205 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] [2023-02-14 13:54:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 13:54:16,205 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:16,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:16,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558015, now seen corresponding path program 1 times [2023-02-14 13:54:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:16,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808832059] [2023-02-14 13:54:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:16,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808832059] [2023-02-14 13:54:16,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808832059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:16,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:16,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 13:54:16,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116477702] [2023-02-14 13:54:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:16,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:54:16,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:16,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:54:16,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:54:16,564 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:16,826 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-02-14 13:54:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:54:16,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 13:54:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:16,827 INFO L225 Difference]: With dead ends: 88 [2023-02-14 13:54:16,827 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 13:54:16,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2023-02-14 13:54:16,828 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 232 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:16,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 164 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:54:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 13:54:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2023-02-14 13:54:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-02-14 13:54:16,830 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 33 [2023-02-14 13:54:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:16,831 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-02-14 13:54:16,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-02-14 13:54:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 13:54:16,831 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:16,831 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] [2023-02-14 13:54:16,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 13:54:16,832 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558014, now seen corresponding path program 1 times [2023-02-14 13:54:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:16,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649717270] [2023-02-14 13:54:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:17,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649717270] [2023-02-14 13:54:17,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649717270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:17,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:17,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:54:17,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556503043] [2023-02-14 13:54:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:17,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 13:54:17,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:17,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 13:54:17,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:54:17,435 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:17,691 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2023-02-14 13:54:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:54:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 13:54:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:17,692 INFO L225 Difference]: With dead ends: 75 [2023-02-14 13:54:17,692 INFO L226 Difference]: Without dead ends: 75 [2023-02-14 13:54:17,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2023-02-14 13:54:17,693 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 205 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:17,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 103 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-14 13:54:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-02-14 13:54:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-14 13:54:17,695 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 33 [2023-02-14 13:54:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:17,695 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-14 13:54:17,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-14 13:54:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:54:17,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:17,696 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, 1, 1] [2023-02-14 13:54:17,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 13:54:17,696 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 873417592, now seen corresponding path program 1 times [2023-02-14 13:54:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:17,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689828389] [2023-02-14 13:54:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689828389] [2023-02-14 13:54:17,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689828389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:17,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:17,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 13:54:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315241997] [2023-02-14 13:54:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:17,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 13:54:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 13:54:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:54:17,914 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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) [2023-02-14 13:54:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:18,071 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-14 13:54:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:54:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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 36 [2023-02-14 13:54:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:18,072 INFO L225 Difference]: With dead ends: 85 [2023-02-14 13:54:18,072 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 13:54:18,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:54:18,073 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 200 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:18,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 163 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 13:54:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2023-02-14 13:54:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 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) [2023-02-14 13:54:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2023-02-14 13:54:18,075 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 36 [2023-02-14 13:54:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:18,075 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2023-02-14 13:54:18,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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) [2023-02-14 13:54:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2023-02-14 13:54:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:54:18,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:18,076 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, 1, 1] [2023-02-14 13:54:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-14 13:54:18,076 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 873417593, now seen corresponding path program 1 times [2023-02-14 13:54:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:18,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794909152] [2023-02-14 13:54:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:54:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:18,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794909152] [2023-02-14 13:54:18,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794909152] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:18,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:18,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:54:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25874213] [2023-02-14 13:54:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:18,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:54:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:18,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:54:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:54:18,433 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:18,614 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2023-02-14 13:54:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:54:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-14 13:54:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:18,615 INFO L225 Difference]: With dead ends: 71 [2023-02-14 13:54:18,615 INFO L226 Difference]: Without dead ends: 71 [2023-02-14 13:54:18,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-02-14 13:54:18,615 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 176 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:18,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 138 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-14 13:54:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2023-02-14 13:54:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2023-02-14 13:54:18,617 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 36 [2023-02-14 13:54:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:18,618 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2023-02-14 13:54:18,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2023-02-14 13:54:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 13:54:18,618 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:18,618 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, 1, 1, 1, 1] [2023-02-14 13:54:18,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 13:54:18,619 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1835685655, now seen corresponding path program 1 times [2023-02-14 13:54:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573619523] [2023-02-14 13:54:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:18,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573619523] [2023-02-14 13:54:18,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573619523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:18,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:18,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 13:54:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364674071] [2023-02-14 13:54:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:18,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 13:54:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 13:54:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:54:18,969 INFO L87 Difference]: Start difference. First operand 69 states and 74 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) [2023-02-14 13:54:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:19,214 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-02-14 13:54:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 13:54:19,215 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 38 [2023-02-14 13:54:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:19,215 INFO L225 Difference]: With dead ends: 69 [2023-02-14 13:54:19,215 INFO L226 Difference]: Without dead ends: 69 [2023-02-14 13:54:19,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:54:19,216 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 181 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:19,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 180 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:54:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-14 13:54:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-14 13:54:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 68 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) [2023-02-14 13:54:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-02-14 13:54:19,218 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 38 [2023-02-14 13:54:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:19,218 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-02-14 13:54:19,218 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) [2023-02-14 13:54:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-02-14 13:54:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:54:19,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:19,219 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:19,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-14 13:54:19,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1288796870, now seen corresponding path program 1 times [2023-02-14 13:54:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:19,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365289893] [2023-02-14 13:54:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:19,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:20,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365289893] [2023-02-14 13:54:20,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365289893] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:20,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:20,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-14 13:54:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053916692] [2023-02-14 13:54:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:20,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 13:54:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 13:54:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-02-14 13:54:20,243 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:21,098 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-02-14 13:54:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 13:54:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-14 13:54:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:21,099 INFO L225 Difference]: With dead ends: 81 [2023-02-14 13:54:21,099 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 13:54:21,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2023-02-14 13:54:21,100 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 276 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:21,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 248 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:54:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 13:54:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2023-02-14 13:54:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 68 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) [2023-02-14 13:54:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2023-02-14 13:54:21,102 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 41 [2023-02-14 13:54:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:21,102 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2023-02-14 13:54:21,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2023-02-14 13:54:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:54:21,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:21,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-14 13:54:21,102 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1835035530, now seen corresponding path program 1 times [2023-02-14 13:54:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:21,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90920764] [2023-02-14 13:54:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:54:22,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:22,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90920764] [2023-02-14 13:54:22,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90920764] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:22,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:22,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-14 13:54:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869547421] [2023-02-14 13:54:22,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:22,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:54:22,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:22,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:54:22,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-02-14 13:54:22,037 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:22,903 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2023-02-14 13:54:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:54:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 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 44 [2023-02-14 13:54:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:22,905 INFO L225 Difference]: With dead ends: 101 [2023-02-14 13:54:22,905 INFO L226 Difference]: Without dead ends: 101 [2023-02-14 13:54:22,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2023-02-14 13:54:22,906 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 445 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:22,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 221 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:54:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-14 13:54:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2023-02-14 13:54:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 70 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) [2023-02-14 13:54:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2023-02-14 13:54:22,915 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 44 [2023-02-14 13:54:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:22,915 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2023-02-14 13:54:22,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2023-02-14 13:54:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:54:22,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:22,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:22,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-14 13:54:22,916 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1835035531, now seen corresponding path program 1 times [2023-02-14 13:54:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:22,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296571155] [2023-02-14 13:54:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:24,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296571155] [2023-02-14 13:54:24,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296571155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:24,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:24,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-14 13:54:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712956736] [2023-02-14 13:54:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:24,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:54:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:54:24,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-02-14 13:54:24,541 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:26,561 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-02-14 13:54:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 13:54:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-14 13:54:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:26,562 INFO L225 Difference]: With dead ends: 117 [2023-02-14 13:54:26,563 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 13:54:26,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2023-02-14 13:54:26,564 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 469 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:26,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 204 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 13:54:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 13:54:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2023-02-14 13:54:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 72 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) [2023-02-14 13:54:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-02-14 13:54:26,566 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 44 [2023-02-14 13:54:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:26,566 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-02-14 13:54:26,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-02-14 13:54:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 13:54:26,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:26,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:26,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-14 13:54:26,567 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1051525325, now seen corresponding path program 1 times [2023-02-14 13:54:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530421189] [2023-02-14 13:54:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:54:27,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:27,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530421189] [2023-02-14 13:54:27,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530421189] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:54:27,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:54:27,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-14 13:54:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048219563] [2023-02-14 13:54:27,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:54:27,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 13:54:27,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:54:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 13:54:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-02-14 13:54:27,405 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:54:28,456 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-02-14 13:54:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 13:54:28,457 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 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 [2023-02-14 13:54:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:54:28,457 INFO L225 Difference]: With dead ends: 88 [2023-02-14 13:54:28,457 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 13:54:28,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 13:54:28,458 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 334 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:54:28,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 285 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:54:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 13:54:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2023-02-14 13:54:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 72 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) [2023-02-14 13:54:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2023-02-14 13:54:28,461 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 45 [2023-02-14 13:54:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:54:28,461 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2023-02-14 13:54:28,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:54:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2023-02-14 13:54:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 13:54:28,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:54:28,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:54:28,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-14 13:54:28,462 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-14 13:54:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:54:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1460157775, now seen corresponding path program 1 times [2023-02-14 13:54:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:54:28,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483999586] [2023-02-14 13:54:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:54:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:54:30,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483999586] [2023-02-14 13:54:30,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483999586] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:54:30,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865055321] [2023-02-14 13:54:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:54:30,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:54:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:54:30,241 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) [2023-02-14 13:54:30,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 13:54:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:54:30,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-14 13:54:30,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:54:30,507 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:30,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:54:30,563 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:30,752 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-14 13:54:30,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-14 13:54:30,873 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-14 13:54:30,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:30,949 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-02-14 13:54:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:30,976 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-02-14 13:54:31,018 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-14 13:54:31,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,207 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:54:31,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-14 13:54:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,295 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-02-14 13:54:31,301 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-14 13:54:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,314 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-14 13:54:31,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,332 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-02-14 13:54:31,336 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-14 13:54:31,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,352 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-14 13:54:31,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,371 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:54:31,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,378 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-02-14 13:54:31,382 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-14 13:54:31,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-02-14 13:54:31,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2023-02-14 13:54:31,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:54:31,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,921 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-14 13:54:31,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 82 [2023-02-14 13:54:31,928 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:54:31,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,930 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 30 [2023-02-14 13:54:31,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,938 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 32 [2023-02-14 13:54:31,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:31,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 35 [2023-02-14 13:54:32,000 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 26 [2023-02-14 13:54:32,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:32,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-02-14 13:54:32,260 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-14 13:54:32,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 53 [2023-02-14 13:54:32,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:54:32,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2023-02-14 13:54:32,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:54:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:54:32,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:54:32,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int))) (= (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1830))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1827))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_prepend_#t~mem10#1.offset| 8) v_ArrVal_1828)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-14 13:54:32,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| Int) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1830))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1827))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| 8) v_ArrVal_1828)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10|)))) is different from false [2023-02-14 13:54:32,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| Int) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse10 |c_ULTIMATE.start_dll_prepend_#t~mem8#1.offset|)))) (or (= (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse10 |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1830))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse2 (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1827))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| v_ArrVal_1826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| 8) v_ArrVal_1828))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10|)))))) is different from false [2023-02-14 13:54:32,887 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| Int) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1830))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse2 (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1827))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| v_ArrVal_1826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| 8) v_ArrVal_1828))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10|)))))) is different from false [2023-02-14 13:54:32,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| Int) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (or (= (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1830))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse2 (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1827))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| 8) v_ArrVal_1828))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10|)))))) is different from false [2023-02-14 13:54:33,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| Int) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1830))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse2 (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1827))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| 8) v_ArrVal_1828))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10|)))))) is different from false [2023-02-14 13:54:33,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 Int) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1821 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| Int) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1819 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1819) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1821 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1821) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1830))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse2 (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1827))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10| 8) v_ArrVal_1828))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_1833) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_10|)))))) is different from false [2023-02-14 13:54:33,295 INFO L350 Elim1Store]: Elim1 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 15546 treesize of output 14862 [2023-02-14 13:54:33,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:33,364 INFO L350 Elim1Store]: Elim1 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 16472 treesize of output 15722 [2023-02-14 13:54:33,616 INFO L350 Elim1Store]: Elim1 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 552850 treesize of output 547848 [2023-02-14 13:54:34,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:54:34,696 INFO L350 Elim1Store]: Elim1 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 587104 treesize of output 580584 [2023-02-14 13:54:36,338 INFO L350 Elim1Store]: Elim1 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 648676 treesize of output 606064 [2023-02-14 13:54:37,525 INFO L350 Elim1Store]: Elim1 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 723424 treesize of output 699712 [2023-02-14 13:54:38,801 INFO L350 Elim1Store]: Elim1 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 824376 treesize of output 798672 [2023-02-14 13:54:40,252 INFO L350 Elim1Store]: Elim1 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 858198 treesize of output 851714 [2023-02-14 13:54:48,668 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 2258 DAG size of output: 2258 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 13:54:57,565 WARN L233 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 2256 DAG size of output: 2256 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)