./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:10:36,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:10:36,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:10:36,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:10:36,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:10:36,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:10:36,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:10:36,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:10:36,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:10:36,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:10:36,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:10:36,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:10:36,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:10:36,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:10:36,528 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:10:36,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:10:36,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:10:36,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:10:36,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:10:36,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:10:36,533 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:10:36,538 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:10:36,538 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:10:36,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:10:36,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:10:36,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:10:36,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:10:36,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:10:36,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:10:36,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:10:36,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:10:36,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:10:36,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:10:36,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:10:36,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:10:36,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:10:36,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:10:36,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:10:36,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:10:36,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:10:36,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:10:36,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:10:36,543 INFO L153 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2024-10-11 18:10:36,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:10:36,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:10:36,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:10:36,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:10:36,831 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:10:36,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-10-11 18:10:38,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:10:38,506 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:10:38,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-10-11 18:10:38,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/100965ca9/14d90c5863a344eea4626a099d6257af/FLAG220ac211f [2024-10-11 18:10:38,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/100965ca9/14d90c5863a344eea4626a099d6257af [2024-10-11 18:10:38,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:10:38,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:10:38,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:10:38,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:10:38,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:10:38,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:10:38" (1/1) ... [2024-10-11 18:10:38,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32726c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:38, skipping insertion in model container [2024-10-11 18:10:38,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:10:38" (1/1) ... [2024-10-11 18:10:38,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:10:39,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:10:39,404 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:10:39,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:10:39,478 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:10:39,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39 WrapperNode [2024-10-11 18:10:39,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:10:39,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:10:39,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:10:39,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:10:39,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,529 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 302 [2024-10-11 18:10:39,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:10:39,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:10:39,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:10:39,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:10:39,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,601 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 10, 34, 3]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 3, 8, 2]. [2024-10-11 18:10:39,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:10:39,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:10:39,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:10:39,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:10:39,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (1/1) ... [2024-10-11 18:10:39,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:10:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:39,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:10:39,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:10:39,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:10:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:10:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:10:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 18:10:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-10-11 18:10:39,762 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-10-11 18:10:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 18:10:39,762 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 18:10:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:10:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:10:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:10:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 18:10:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:10:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:10:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:10:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:10:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:10:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:10:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 18:10:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:10:39,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 18:10:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:10:39,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:10:40,039 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:10:40,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:10:40,474 INFO L? ?]: Removed 241 outVars from TransFormulas that were not future-live. [2024-10-11 18:10:40,474 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:10:40,517 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:10:40,517 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-11 18:10:40,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:10:40 BoogieIcfgContainer [2024-10-11 18:10:40,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:10:40,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:10:40,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:10:40,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:10:40,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:10:38" (1/3) ... [2024-10-11 18:10:40,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6a75c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:10:40, skipping insertion in model container [2024-10-11 18:10:40,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:39" (2/3) ... [2024-10-11 18:10:40,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6a75c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:10:40, skipping insertion in model container [2024-10-11 18:10:40,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:10:40" (3/3) ... [2024-10-11 18:10:40,530 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2024-10-11 18:10:40,566 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:10:40,566 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2024-10-11 18:10:40,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:10:40,707 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@360d083b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:10:40,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2024-10-11 18:10:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 113 states have (on average 2.47787610619469) internal successors, (280), 233 states have internal predecessors, (280), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 18:10:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:10:40,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:40,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:10:40,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash 19263457, now seen corresponding path program 1 times [2024-10-11 18:10:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930717649] [2024-10-11 18:10:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930717649] [2024-10-11 18:10:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930717649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522943585] [2024-10-11 18:10:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:40,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 18:10:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:40,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 18:10:40,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:10:40,875 INFO L87 Difference]: Start difference. First operand has 236 states, 113 states have (on average 2.47787610619469) internal successors, (280), 233 states have internal predecessors, (280), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:40,951 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2024-10-11 18:10:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 18:10:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:10:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:40,962 INFO L225 Difference]: With dead ends: 234 [2024-10-11 18:10:40,963 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 18:10:40,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 18:10:40,967 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:40,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:10:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 18:10:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-10-11 18:10:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 112 states have (on average 2.1517857142857144) internal successors, (241), 230 states have internal predecessors, (241), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2024-10-11 18:10:41,022 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 4 [2024-10-11 18:10:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,022 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2024-10-11 18:10:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2024-10-11 18:10:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:10:41,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:10:41,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:10:41,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:41,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash 596107148, now seen corresponding path program 1 times [2024-10-11 18:10:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504404628] [2024-10-11 18:10:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504404628] [2024-10-11 18:10:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504404628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158926822] [2024-10-11 18:10:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,127 INFO L87 Difference]: Start difference. First operand 233 states and 258 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) [2024-10-11 18:10:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:41,271 INFO L93 Difference]: Finished difference Result 231 states and 256 transitions. [2024-10-11 18:10:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:41,272 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 [2024-10-11 18:10:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:41,273 INFO L225 Difference]: With dead ends: 231 [2024-10-11 18:10:41,274 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 18:10:41,275 INFO L431 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 [2024-10-11 18:10:41,276 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:41,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 372 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 18:10:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-10-11 18:10:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 112 states have (on average 2.1339285714285716) internal successors, (239), 228 states have internal predecessors, (239), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions. [2024-10-11 18:10:41,304 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 5 [2024-10-11 18:10:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,304 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions. [2024-10-11 18:10:41,305 INFO L472 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) [2024-10-11 18:10:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions. [2024-10-11 18:10:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:10:41,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:10:41,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:10:41,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:41,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 596107149, now seen corresponding path program 1 times [2024-10-11 18:10:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148516531] [2024-10-11 18:10:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148516531] [2024-10-11 18:10:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148516531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:41,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249099017] [2024-10-11 18:10:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,450 INFO L87 Difference]: Start difference. First operand 231 states and 256 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) [2024-10-11 18:10:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:41,589 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2024-10-11 18:10:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:41,590 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 [2024-10-11 18:10:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:41,594 INFO L225 Difference]: With dead ends: 229 [2024-10-11 18:10:41,594 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 18:10:41,595 INFO L431 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 [2024-10-11 18:10:41,595 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 4 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:41,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 379 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 18:10:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-11 18:10:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 112 states have (on average 2.1160714285714284) internal successors, (237), 226 states have internal predecessors, (237), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2024-10-11 18:10:41,614 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 5 [2024-10-11 18:10:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2024-10-11 18:10:41,615 INFO L472 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) [2024-10-11 18:10:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2024-10-11 18:10:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:10:41,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:10:41,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:10:41,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:41,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 596106590, now seen corresponding path program 1 times [2024-10-11 18:10:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164155946] [2024-10-11 18:10:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164155946] [2024-10-11 18:10:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164155946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:10:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225319354] [2024-10-11 18:10:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,650 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2024-10-11 18:10:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:41,857 INFO L93 Difference]: Finished difference Result 354 states and 398 transitions. [2024-10-11 18:10:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 [2024-10-11 18:10:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:41,859 INFO L225 Difference]: With dead ends: 354 [2024-10-11 18:10:41,862 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 18:10:41,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,863 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 125 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:41,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 325 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 18:10:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 232. [2024-10-11 18:10:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 115 states have (on average 2.0956521739130434) internal successors, (241), 229 states have internal predecessors, (241), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 258 transitions. [2024-10-11 18:10:41,883 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 258 transitions. Word has length 5 [2024-10-11 18:10:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:41,883 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 258 transitions. [2024-10-11 18:10:41,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2024-10-11 18:10:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 258 transitions. [2024-10-11 18:10:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:10:41,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:41,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:41,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:10:41,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:41,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1627403256, now seen corresponding path program 1 times [2024-10-11 18:10:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:41,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404534886] [2024-10-11 18:10:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404534886] [2024-10-11 18:10:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404534886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:41,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926532526] [2024-10-11 18:10:41,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:41,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:41,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:41,936 INFO L87 Difference]: Start difference. First operand 232 states and 258 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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) [2024-10-11 18:10:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,002 INFO L93 Difference]: Finished difference Result 242 states and 267 transitions. [2024-10-11 18:10:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:42,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 [2024-10-11 18:10:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,004 INFO L225 Difference]: With dead ends: 242 [2024-10-11 18:10:42,004 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 18:10:42,004 INFO L431 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 [2024-10-11 18:10:42,005 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 10 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 439 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 18:10:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2024-10-11 18:10:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 114 states have (on average 2.0964912280701755) internal successors, (239), 228 states have internal predecessors, (239), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions. [2024-10-11 18:10:42,013 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 7 [2024-10-11 18:10:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions. [2024-10-11 18:10:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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) [2024-10-11 18:10:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions. [2024-10-11 18:10:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:10:42,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:10:42,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1045028143, now seen corresponding path program 1 times [2024-10-11 18:10:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588031369] [2024-10-11 18:10:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588031369] [2024-10-11 18:10:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588031369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874214256] [2024-10-11 18:10:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:42,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:42,081 INFO L87 Difference]: Start difference. First operand 231 states and 256 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,222 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2024-10-11 18:10:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:42,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:10:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,224 INFO L225 Difference]: With dead ends: 229 [2024-10-11 18:10:42,224 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 18:10:42,225 INFO L431 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 [2024-10-11 18:10:42,225 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 18:10:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-11 18:10:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 114 states have (on average 2.0789473684210527) internal successors, (237), 226 states have internal predecessors, (237), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2024-10-11 18:10:42,231 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 8 [2024-10-11 18:10:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2024-10-11 18:10:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2024-10-11 18:10:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:10:42,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:10:42,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:42,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1045028142, now seen corresponding path program 1 times [2024-10-11 18:10:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405550800] [2024-10-11 18:10:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405550800] [2024-10-11 18:10:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405550800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883378614] [2024-10-11 18:10:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:42,311 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,454 INFO L93 Difference]: Finished difference Result 227 states and 252 transitions. [2024-10-11 18:10:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:42,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:10:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,456 INFO L225 Difference]: With dead ends: 227 [2024-10-11 18:10:42,456 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 18:10:42,456 INFO L431 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 [2024-10-11 18:10:42,457 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 1 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 376 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 18:10:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-10-11 18:10:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 114 states have (on average 2.06140350877193) internal successors, (235), 224 states have internal predecessors, (235), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 252 transitions. [2024-10-11 18:10:42,464 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 252 transitions. Word has length 8 [2024-10-11 18:10:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,464 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 252 transitions. [2024-10-11 18:10:42,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 252 transitions. [2024-10-11 18:10:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:10:42,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,465 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:10:42,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1760102883, now seen corresponding path program 1 times [2024-10-11 18:10:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709186846] [2024-10-11 18:10:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709186846] [2024-10-11 18:10:42,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709186846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020072399] [2024-10-11 18:10:42,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:10:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:10:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:42,524 INFO L87 Difference]: Start difference. First operand 227 states and 252 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,666 INFO L93 Difference]: Finished difference Result 274 states and 310 transitions. [2024-10-11 18:10:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:42,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:10:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,668 INFO L225 Difference]: With dead ends: 274 [2024-10-11 18:10:42,668 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 18:10:42,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:42,669 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 108 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:42,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 570 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 18:10:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 227. [2024-10-11 18:10:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 114 states have (on average 2.0526315789473686) internal successors, (234), 224 states have internal predecessors, (234), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 251 transitions. [2024-10-11 18:10:42,676 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 251 transitions. Word has length 13 [2024-10-11 18:10:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,676 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 251 transitions. [2024-10-11 18:10:42,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 251 transitions. [2024-10-11 18:10:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:10:42,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,677 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:10:42,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash -758623427, now seen corresponding path program 1 times [2024-10-11 18:10:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686124734] [2024-10-11 18:10:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686124734] [2024-10-11 18:10:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686124734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506224024] [2024-10-11 18:10:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:42,779 INFO L87 Difference]: Start difference. First operand 227 states and 251 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:43,056 INFO L93 Difference]: Finished difference Result 226 states and 252 transitions. [2024-10-11 18:10:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:10:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:43,058 INFO L225 Difference]: With dead ends: 226 [2024-10-11 18:10:43,058 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 18:10:43,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:43,058 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 142 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:43,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 433 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 18:10:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2024-10-11 18:10:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 116 states have (on average 1.9741379310344827) internal successors, (229), 217 states have internal predecessors, (229), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 246 transitions. [2024-10-11 18:10:43,064 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 246 transitions. Word has length 15 [2024-10-11 18:10:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:43,064 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 246 transitions. [2024-10-11 18:10:43,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 246 transitions. [2024-10-11 18:10:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:10:43,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:43,065 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:43,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:10:43,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:43,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -758623426, now seen corresponding path program 1 times [2024-10-11 18:10:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910269909] [2024-10-11 18:10:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910269909] [2024-10-11 18:10:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910269909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038784495] [2024-10-11 18:10:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:43,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:43,184 INFO L87 Difference]: Start difference. First operand 220 states and 246 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:43,521 INFO L93 Difference]: Finished difference Result 302 states and 341 transitions. [2024-10-11 18:10:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:10:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:43,523 INFO L225 Difference]: With dead ends: 302 [2024-10-11 18:10:43,523 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 18:10:43,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:43,524 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 177 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:43,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 507 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 18:10:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 264. [2024-10-11 18:10:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 160 states have (on average 1.86875) internal successors, (299), 261 states have internal predecessors, (299), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 316 transitions. [2024-10-11 18:10:43,533 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 316 transitions. Word has length 15 [2024-10-11 18:10:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:43,533 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 316 transitions. [2024-10-11 18:10:43,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 316 transitions. [2024-10-11 18:10:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:10:43,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:43,534 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:43,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:10:43,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:43,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1118155553, now seen corresponding path program 1 times [2024-10-11 18:10:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382234510] [2024-10-11 18:10:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:43,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382234510] [2024-10-11 18:10:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382234510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:43,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:43,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:43,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742887270] [2024-10-11 18:10:43,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:43,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:43,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:43,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:43,594 INFO L87 Difference]: Start difference. First operand 264 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:43,850 INFO L93 Difference]: Finished difference Result 301 states and 338 transitions. [2024-10-11 18:10:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:10:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:43,852 INFO L225 Difference]: With dead ends: 301 [2024-10-11 18:10:43,852 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 18:10:43,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:43,852 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 177 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:43,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 719 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 18:10:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 263. [2024-10-11 18:10:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 160 states have (on average 1.85) internal successors, (296), 260 states have internal predecessors, (296), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 312 transitions. [2024-10-11 18:10:43,863 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 312 transitions. Word has length 17 [2024-10-11 18:10:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:43,868 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 312 transitions. [2024-10-11 18:10:43,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 312 transitions. [2024-10-11 18:10:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:10:43,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:43,869 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:43,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:10:43,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1607132515, now seen corresponding path program 1 times [2024-10-11 18:10:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452218940] [2024-10-11 18:10:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:10:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:43,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452218940] [2024-10-11 18:10:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452218940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:43,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:43,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207927515] [2024-10-11 18:10:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:43,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:44,000 INFO L87 Difference]: Start difference. First operand 263 states and 312 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,204 INFO L93 Difference]: Finished difference Result 262 states and 309 transitions. [2024-10-11 18:10:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:44,205 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:10:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,206 INFO L225 Difference]: With dead ends: 262 [2024-10-11 18:10:44,206 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 18:10:44,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:44,207 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:44,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 720 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 18:10:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-11 18:10:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 160 states have (on average 1.8375) internal successors, (294), 259 states have internal predecessors, (294), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2024-10-11 18:10:44,216 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 24 [2024-10-11 18:10:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,217 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2024-10-11 18:10:44,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2024-10-11 18:10:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:10:44,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,218 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:10:44,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:44,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1642051815, now seen corresponding path program 1 times [2024-10-11 18:10:44,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715507035] [2024-10-11 18:10:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:10:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715507035] [2024-10-11 18:10:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715507035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:44,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369043886] [2024-10-11 18:10:44,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:44,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:44,329 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,500 INFO L93 Difference]: Finished difference Result 261 states and 306 transitions. [2024-10-11 18:10:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:44,500 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:10:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,502 INFO L225 Difference]: With dead ends: 261 [2024-10-11 18:10:44,502 INFO L226 Difference]: Without dead ends: 261 [2024-10-11 18:10:44,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:44,503 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 15 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:44,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 710 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-11 18:10:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-10-11 18:10:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 160 states have (on average 1.825) internal successors, (292), 258 states have internal predecessors, (292), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 306 transitions. [2024-10-11 18:10:44,510 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 306 transitions. Word has length 24 [2024-10-11 18:10:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,510 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 306 transitions. [2024-10-11 18:10:44,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 306 transitions. [2024-10-11 18:10:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:44,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,511 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:44,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:10:44,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:44,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash -902173940, now seen corresponding path program 1 times [2024-10-11 18:10:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839414208] [2024-10-11 18:10:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839414208] [2024-10-11 18:10:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839414208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:10:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423512190] [2024-10-11 18:10:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:44,790 INFO L87 Difference]: Start difference. First operand 261 states and 306 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:45,254 INFO L93 Difference]: Finished difference Result 290 states and 322 transitions. [2024-10-11 18:10:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 18:10:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:45,256 INFO L225 Difference]: With dead ends: 290 [2024-10-11 18:10:45,257 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 18:10:45,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:45,258 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 151 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:45,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 853 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:10:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 18:10:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 262. [2024-10-11 18:10:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.826086956521739) internal successors, (294), 259 states have internal predecessors, (294), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2024-10-11 18:10:45,264 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 26 [2024-10-11 18:10:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:45,264 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2024-10-11 18:10:45,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2024-10-11 18:10:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:45,266 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:45,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:10:45,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -902173939, now seen corresponding path program 1 times [2024-10-11 18:10:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:45,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736836533] [2024-10-11 18:10:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736836533] [2024-10-11 18:10:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736836533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:45,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:10:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888058066] [2024-10-11 18:10:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:45,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:45,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:45,619 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:46,112 INFO L93 Difference]: Finished difference Result 289 states and 321 transitions. [2024-10-11 18:10:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:46,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 18:10:46,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:46,114 INFO L225 Difference]: With dead ends: 289 [2024-10-11 18:10:46,114 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 18:10:46,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:46,115 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 150 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:46,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 735 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:10:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 18:10:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 262. [2024-10-11 18:10:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.8198757763975155) internal successors, (293), 259 states have internal predecessors, (293), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 307 transitions. [2024-10-11 18:10:46,121 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 307 transitions. Word has length 26 [2024-10-11 18:10:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:46,122 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 307 transitions. [2024-10-11 18:10:46,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 307 transitions. [2024-10-11 18:10:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:10:46,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:46,122 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:46,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:10:46,123 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:46,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2104066315, now seen corresponding path program 1 times [2024-10-11 18:10:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357276215] [2024-10-11 18:10:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:46,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357276215] [2024-10-11 18:10:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357276215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:10:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655796745] [2024-10-11 18:10:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:46,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:10:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:10:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:46,269 INFO L87 Difference]: Start difference. First operand 262 states and 307 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:46,493 INFO L93 Difference]: Finished difference Result 288 states and 319 transitions. [2024-10-11 18:10:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 18:10:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:46,495 INFO L225 Difference]: With dead ends: 288 [2024-10-11 18:10:46,495 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 18:10:46,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:10:46,495 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 150 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:46,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1007 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 18:10:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 262. [2024-10-11 18:10:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.813664596273292) internal successors, (292), 259 states have internal predecessors, (292), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2024-10-11 18:10:46,500 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 27 [2024-10-11 18:10:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:46,500 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2024-10-11 18:10:46,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2024-10-11 18:10:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:10:46,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:46,501 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:10:46,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1714885346, now seen corresponding path program 1 times [2024-10-11 18:10:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122511994] [2024-10-11 18:10:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122511994] [2024-10-11 18:10:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122511994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:46,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:10:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403235404] [2024-10-11 18:10:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:10:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:10:46,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:46,639 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:46,838 INFO L93 Difference]: Finished difference Result 287 states and 317 transitions. [2024-10-11 18:10:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 18:10:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:46,840 INFO L225 Difference]: With dead ends: 287 [2024-10-11 18:10:46,840 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 18:10:46,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:10:46,841 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 148 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:46,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1007 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 18:10:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 262. [2024-10-11 18:10:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.8074534161490683) internal successors, (291), 259 states have internal predecessors, (291), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 305 transitions. [2024-10-11 18:10:46,845 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 305 transitions. Word has length 27 [2024-10-11 18:10:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:46,845 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 305 transitions. [2024-10-11 18:10:46,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 305 transitions. [2024-10-11 18:10:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:46,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:46,846 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:46,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:10:46,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1191316654, now seen corresponding path program 1 times [2024-10-11 18:10:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520547416] [2024-10-11 18:10:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520547416] [2024-10-11 18:10:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520547416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:10:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043612477] [2024-10-11 18:10:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:47,018 INFO L87 Difference]: Start difference. First operand 262 states and 305 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:47,444 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2024-10-11 18:10:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:47,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 18:10:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:47,445 INFO L225 Difference]: With dead ends: 286 [2024-10-11 18:10:47,445 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 18:10:47,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:47,446 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 144 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:47,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 976 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:10:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 18:10:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2024-10-11 18:10:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.8012422360248448) internal successors, (290), 259 states have internal predecessors, (290), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2024-10-11 18:10:47,451 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 26 [2024-10-11 18:10:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:47,451 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2024-10-11 18:10:47,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2024-10-11 18:10:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:47,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:47,452 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:47,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:10:47,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:47,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1191316655, now seen corresponding path program 1 times [2024-10-11 18:10:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531091380] [2024-10-11 18:10:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:47,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:47,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531091380] [2024-10-11 18:10:47,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531091380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:47,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:10:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148447630] [2024-10-11 18:10:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:47,883 INFO L87 Difference]: Start difference. First operand 262 states and 304 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:48,612 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2024-10-11 18:10:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:48,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 18:10:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:48,614 INFO L225 Difference]: With dead ends: 285 [2024-10-11 18:10:48,618 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 18:10:48,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:48,619 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 142 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:48,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 938 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:10:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 18:10:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 262. [2024-10-11 18:10:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.795031055900621) internal successors, (289), 259 states have internal predecessors, (289), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 303 transitions. [2024-10-11 18:10:48,626 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 303 transitions. Word has length 26 [2024-10-11 18:10:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:48,626 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 303 transitions. [2024-10-11 18:10:48,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2024-10-11 18:10:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:10:48,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:48,627 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:10:48,627 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:48,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash -698708840, now seen corresponding path program 1 times [2024-10-11 18:10:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:48,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340697053] [2024-10-11 18:10:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340697053] [2024-10-11 18:10:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340697053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:10:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086645844] [2024-10-11 18:10:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:49,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:49,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:49,051 INFO L87 Difference]: Start difference. First operand 262 states and 303 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:49,428 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2024-10-11 18:10:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 18:10:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:49,430 INFO L225 Difference]: With dead ends: 284 [2024-10-11 18:10:49,430 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 18:10:49,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:49,430 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 140 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:49,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1291 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 18:10:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2024-10-11 18:10:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 162 states have (on average 1.7901234567901234) internal successors, (290), 260 states have internal predecessors, (290), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2024-10-11 18:10:49,435 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 31 [2024-10-11 18:10:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:49,435 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2024-10-11 18:10:49,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2024-10-11 18:10:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:10:49,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:49,436 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:49,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:10:49,437 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:49,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1985666667, now seen corresponding path program 1 times [2024-10-11 18:10:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:49,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544551153] [2024-10-11 18:10:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544551153] [2024-10-11 18:10:49,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544551153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:49,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:49,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:10:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393885939] [2024-10-11 18:10:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:49,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:10:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:10:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:10:49,687 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:50,047 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2024-10-11 18:10:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 18:10:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:50,049 INFO L225 Difference]: With dead ends: 283 [2024-10-11 18:10:50,049 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 18:10:50,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:50,050 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 138 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:50,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1291 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:10:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 18:10:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2024-10-11 18:10:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 162 states have (on average 1.7839506172839505) internal successors, (289), 260 states have internal predecessors, (289), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 303 transitions. [2024-10-11 18:10:50,054 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 303 transitions. Word has length 31 [2024-10-11 18:10:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:50,054 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 303 transitions. [2024-10-11 18:10:50,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 303 transitions. [2024-10-11 18:10:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:10:50,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:50,055 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:50,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:10:50,055 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:50,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1460224768, now seen corresponding path program 1 times [2024-10-11 18:10:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510983029] [2024-10-11 18:10:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:50,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:50,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510983029] [2024-10-11 18:10:50,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510983029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:50,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437930026] [2024-10-11 18:10:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:50,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:50,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:10:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:50,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:10:50,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:50,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:10:50,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:10:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:50,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437930026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:50,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:50,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-10-11 18:10:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371225552] [2024-10-11 18:10:50,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:50,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:10:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:50,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:10:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:50,641 INFO L87 Difference]: Start difference. First operand 263 states and 303 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:50,921 INFO L93 Difference]: Finished difference Result 330 states and 377 transitions. [2024-10-11 18:10:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:10:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 18:10:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:50,922 INFO L225 Difference]: With dead ends: 330 [2024-10-11 18:10:50,922 INFO L226 Difference]: Without dead ends: 330 [2024-10-11 18:10:50,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:10:50,923 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 129 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:50,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1425 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-11 18:10:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 276. [2024-10-11 18:10:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 175 states have (on average 1.7314285714285715) internal successors, (303), 273 states have internal predecessors, (303), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2024-10-11 18:10:50,927 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 30 [2024-10-11 18:10:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2024-10-11 18:10:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2024-10-11 18:10:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:10:50,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:50,928 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:50,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:10:51,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:10:51,135 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:51,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1311023818, now seen corresponding path program 1 times [2024-10-11 18:10:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723004852] [2024-10-11 18:10:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:10:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:51,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723004852] [2024-10-11 18:10:51,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723004852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:51,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536738158] [2024-10-11 18:10:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:51,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:51,226 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:51,437 INFO L93 Difference]: Finished difference Result 278 states and 321 transitions. [2024-10-11 18:10:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:51,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 [2024-10-11 18:10:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:51,438 INFO L225 Difference]: With dead ends: 278 [2024-10-11 18:10:51,438 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 18:10:51,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:51,438 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 191 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:51,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 436 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 18:10:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2024-10-11 18:10:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.7231638418079096) internal successors, (305), 273 states have internal predecessors, (305), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 319 transitions. [2024-10-11 18:10:51,444 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 319 transitions. Word has length 33 [2024-10-11 18:10:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 319 transitions. [2024-10-11 18:10:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 319 transitions. [2024-10-11 18:10:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:10:51,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:51,445 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:51,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:10:51,445 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1311023819, now seen corresponding path program 1 times [2024-10-11 18:10:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779351839] [2024-10-11 18:10:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779351839] [2024-10-11 18:10:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779351839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10327401] [2024-10-11 18:10:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:51,575 INFO L87 Difference]: Start difference. First operand 276 states and 319 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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) [2024-10-11 18:10:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:51,807 INFO L93 Difference]: Finished difference Result 300 states and 333 transitions. [2024-10-11 18:10:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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 [2024-10-11 18:10:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:51,809 INFO L225 Difference]: With dead ends: 300 [2024-10-11 18:10:51,809 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 18:10:51,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:51,810 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 80 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:51,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 496 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 18:10:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 281. [2024-10-11 18:10:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 182 states have (on average 1.7142857142857142) internal successors, (312), 278 states have internal predecessors, (312), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 326 transitions. [2024-10-11 18:10:51,815 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 326 transitions. Word has length 33 [2024-10-11 18:10:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:51,815 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 326 transitions. [2024-10-11 18:10:51,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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) [2024-10-11 18:10:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 326 transitions. [2024-10-11 18:10:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:10:51,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:51,816 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:10:51,816 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:51,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1987040505, now seen corresponding path program 1 times [2024-10-11 18:10:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:51,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041515861] [2024-10-11 18:10:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041515861] [2024-10-11 18:10:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041515861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945136243] [2024-10-11 18:10:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:51,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:51,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:51,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:51,872 INFO L87 Difference]: Start difference. First operand 281 states and 326 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:51,981 INFO L93 Difference]: Finished difference Result 345 states and 387 transitions. [2024-10-11 18:10:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:51,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 18:10:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:51,983 INFO L225 Difference]: With dead ends: 345 [2024-10-11 18:10:51,983 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 18:10:51,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:51,984 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 131 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:51,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 719 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 18:10:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 281. [2024-10-11 18:10:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 278 states have internal predecessors, (311), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 325 transitions. [2024-10-11 18:10:51,993 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 325 transitions. Word has length 34 [2024-10-11 18:10:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 325 transitions. [2024-10-11 18:10:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 325 transitions. [2024-10-11 18:10:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:10:51,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:51,994 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:10:51,994 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1470519639, now seen corresponding path program 1 times [2024-10-11 18:10:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530431410] [2024-10-11 18:10:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:10:52,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:52,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530431410] [2024-10-11 18:10:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530431410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:52,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:52,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:10:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927670425] [2024-10-11 18:10:52,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:10:52,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:52,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:10:52,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:52,042 INFO L87 Difference]: Start difference. First operand 281 states and 325 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:52,193 INFO L93 Difference]: Finished difference Result 278 states and 319 transitions. [2024-10-11 18:10:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:10:52,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 18:10:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:52,195 INFO L225 Difference]: With dead ends: 278 [2024-10-11 18:10:52,195 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 18:10:52,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:52,195 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 103 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:52,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 350 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 18:10:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-11 18:10:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 182 states have (on average 1.6758241758241759) internal successors, (305), 275 states have internal predecessors, (305), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 319 transitions. [2024-10-11 18:10:52,200 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 319 transitions. Word has length 35 [2024-10-11 18:10:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:52,201 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 319 transitions. [2024-10-11 18:10:52,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 319 transitions. [2024-10-11 18:10:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:10:52,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:52,201 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:10:52,202 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1470519640, now seen corresponding path program 1 times [2024-10-11 18:10:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:52,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672890801] [2024-10-11 18:10:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672890801] [2024-10-11 18:10:52,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672890801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:52,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278662568] [2024-10-11 18:10:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:52,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:52,300 INFO L87 Difference]: Start difference. First operand 278 states and 319 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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) [2024-10-11 18:10:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:52,529 INFO L93 Difference]: Finished difference Result 288 states and 320 transitions. [2024-10-11 18:10:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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 35 [2024-10-11 18:10:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:52,531 INFO L225 Difference]: With dead ends: 288 [2024-10-11 18:10:52,531 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 18:10:52,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:52,532 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 77 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:52,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 492 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 18:10:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 278. [2024-10-11 18:10:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 182 states have (on average 1.6593406593406594) internal successors, (302), 275 states have internal predecessors, (302), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 316 transitions. [2024-10-11 18:10:52,540 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 316 transitions. Word has length 35 [2024-10-11 18:10:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 316 transitions. [2024-10-11 18:10:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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) [2024-10-11 18:10:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 316 transitions. [2024-10-11 18:10:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:10:52,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:52,541 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:52,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 18:10:52,541 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:52,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash 126314757, now seen corresponding path program 1 times [2024-10-11 18:10:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122655281] [2024-10-11 18:10:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122655281] [2024-10-11 18:10:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122655281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:52,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:52,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078590057] [2024-10-11 18:10:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:52,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:52,585 INFO L87 Difference]: Start difference. First operand 278 states and 316 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:52,684 INFO L93 Difference]: Finished difference Result 289 states and 321 transitions. [2024-10-11 18:10:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:52,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 18:10:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:52,686 INFO L225 Difference]: With dead ends: 289 [2024-10-11 18:10:52,686 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 18:10:52,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:52,686 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 81 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:52,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 714 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:10:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 18:10:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 278. [2024-10-11 18:10:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 182 states have (on average 1.6538461538461537) internal successors, (301), 275 states have internal predecessors, (301), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 315 transitions. [2024-10-11 18:10:52,691 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 315 transitions. Word has length 37 [2024-10-11 18:10:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 315 transitions. [2024-10-11 18:10:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 315 transitions. [2024-10-11 18:10:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:10:52,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:52,692 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:10:52,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:10:52,692 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:52,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1712905756, now seen corresponding path program 1 times [2024-10-11 18:10:52,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:52,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434219935] [2024-10-11 18:10:52,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:52,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434219935] [2024-10-11 18:10:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434219935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253586449] [2024-10-11 18:10:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:52,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:52,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:52,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:10:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:53,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:10:53,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:53,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:10:53,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:10:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:53,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253586449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:53,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-10-11 18:10:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353586747] [2024-10-11 18:10:53,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:10:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:10:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:10:53,295 INFO L87 Difference]: Start difference. First operand 278 states and 315 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:53,499 INFO L93 Difference]: Finished difference Result 325 states and 366 transitions. [2024-10-11 18:10:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 18:10:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:53,500 INFO L225 Difference]: With dead ends: 325 [2024-10-11 18:10:53,500 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 18:10:53,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:10:53,501 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 64 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:53,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1068 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:10:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 18:10:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 293. [2024-10-11 18:10:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 197 states have (on average 1.6040609137055837) internal successors, (316), 290 states have internal predecessors, (316), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 330 transitions. [2024-10-11 18:10:53,506 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 330 transitions. Word has length 36 [2024-10-11 18:10:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:53,506 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 330 transitions. [2024-10-11 18:10:53,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:10:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 330 transitions. [2024-10-11 18:10:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:10:53,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:53,507 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:53,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:10:53,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:10:53,711 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -756596709, now seen corresponding path program 2 times [2024-10-11 18:10:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694510711] [2024-10-11 18:10:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694510711] [2024-10-11 18:10:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694510711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382252389] [2024-10-11 18:10:54,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:10:54,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:54,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:54,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:10:54,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:10:54,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:10:54,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 18:10:54,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:54,769 INFO L378 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 [2024-10-11 18:10:54,807 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:10:54,810 INFO L378 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 14 treesize of output 13 [2024-10-11 18:10:54,854 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:10:54,855 INFO L378 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 18 treesize of output 17 [2024-10-11 18:10:54,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:10:54,950 INFO L378 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 44 treesize of output 32 [2024-10-11 18:10:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 18:10:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:55,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:55,820 INFO L378 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 33 treesize of output 29 [2024-10-11 18:10:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 148 [2024-10-11 18:10:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382252389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:56,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 27 [2024-10-11 18:10:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362594075] [2024-10-11 18:10:56,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:56,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 18:10:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 18:10:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-10-11 18:10:56,132 INFO L87 Difference]: Start difference. First operand 293 states and 330 transitions. Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 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) [2024-10-11 18:10:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:57,813 INFO L93 Difference]: Finished difference Result 328 states and 370 transitions. [2024-10-11 18:10:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:10:57,814 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 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) Word has length 38 [2024-10-11 18:10:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:57,815 INFO L225 Difference]: With dead ends: 328 [2024-10-11 18:10:57,815 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 18:10:57,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 18:10:57,816 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 457 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:57,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1714 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 18:10:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 18:10:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2024-10-11 18:10:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 198 states have (on average 1.606060606060606) internal successors, (318), 291 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:10:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 332 transitions. [2024-10-11 18:10:57,832 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 332 transitions. Word has length 38 [2024-10-11 18:10:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 332 transitions. [2024-10-11 18:10:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 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) [2024-10-11 18:10:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 332 transitions. [2024-10-11 18:10:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:10:57,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:57,832 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:57,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:10:58,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:58,035 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:10:58,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -756596708, now seen corresponding path program 1 times [2024-10-11 18:10:58,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195878384] [2024-10-11 18:10:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195878384] [2024-10-11 18:10:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195878384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554929927] [2024-10-11 18:10:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:58,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:58,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:58,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:58,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:10:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:59,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 18:10:59,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:59,085 INFO L378 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 [2024-10-11 18:10:59,092 INFO L378 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 8 treesize of output 1 [2024-10-11 18:10:59,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:59,124 INFO L378 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 14 treesize of output 9 [2024-10-11 18:10:59,139 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:10:59,139 INFO L378 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 [2024-10-11 18:10:59,195 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:10:59,196 INFO L378 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 14 treesize of output 13 [2024-10-11 18:10:59,213 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:10:59,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:10:59,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:10:59,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:10:59,404 INFO L378 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 25 treesize of output 13 [2024-10-11 18:10:59,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:10:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:59,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:10:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554929927] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:59,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-10-11 18:10:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763813677] [2024-10-11 18:10:59,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:10:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:10:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:10:59,834 INFO L87 Difference]: Start difference. First operand 294 states and 332 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 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) [2024-10-11 18:11:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:01,122 INFO L93 Difference]: Finished difference Result 369 states and 411 transitions. [2024-10-11 18:11:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:11:01,123 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 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) Word has length 38 [2024-10-11 18:11:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:01,124 INFO L225 Difference]: With dead ends: 369 [2024-10-11 18:11:01,124 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 18:11:01,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 18:11:01,126 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1232 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:01,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 1335 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 18:11:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 18:11:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 310. [2024-10-11 18:11:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 217 states have (on average 1.5576036866359446) internal successors, (338), 307 states have internal predecessors, (338), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 352 transitions. [2024-10-11 18:11:01,131 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 352 transitions. Word has length 38 [2024-10-11 18:11:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:01,131 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 352 transitions. [2024-10-11 18:11:01,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 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) [2024-10-11 18:11:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 352 transitions. [2024-10-11 18:11:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 18:11:01,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:01,132 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-10-11 18:11:01,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:11:01,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-11 18:11:01,333 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:01,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash 195222749, now seen corresponding path program 1 times [2024-10-11 18:11:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:01,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821155920] [2024-10-11 18:11:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:01,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821155920] [2024-10-11 18:11:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821155920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55030771] [2024-10-11 18:11:01,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:01,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:01,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:01,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:01,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:11:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:01,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:11:01,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:01,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:11:01,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:11:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:01,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:01,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55030771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:01,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:01,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 10 [2024-10-11 18:11:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777840421] [2024-10-11 18:11:01,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:11:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:11:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:11:01,972 INFO L87 Difference]: Start difference. First operand 310 states and 352 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:02,195 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2024-10-11 18:11:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:11:02,196 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 18:11:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:02,197 INFO L225 Difference]: With dead ends: 341 [2024-10-11 18:11:02,197 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 18:11:02,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:11:02,198 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 46 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:02,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1222 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 18:11:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 315. [2024-10-11 18:11:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 222 states have (on average 1.545045045045045) internal successors, (343), 312 states have internal predecessors, (343), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 357 transitions. [2024-10-11 18:11:02,202 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 357 transitions. Word has length 40 [2024-10-11 18:11:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 357 transitions. [2024-10-11 18:11:02,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 357 transitions. [2024-10-11 18:11:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:11:02,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:02,203 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-11 18:11:02,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:11:02,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:02,408 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1491901324, now seen corresponding path program 1 times [2024-10-11 18:11:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824187915] [2024-10-11 18:11:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824187915] [2024-10-11 18:11:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824187915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:02,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:02,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:11:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764795189] [2024-10-11 18:11:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:02,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:11:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:11:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:11:02,582 INFO L87 Difference]: Start difference. First operand 315 states and 357 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:02,807 INFO L93 Difference]: Finished difference Result 325 states and 360 transitions. [2024-10-11 18:11:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:11:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 18:11:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:02,809 INFO L225 Difference]: With dead ends: 325 [2024-10-11 18:11:02,809 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 18:11:02,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:11:02,810 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 107 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:02,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1017 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 18:11:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 315. [2024-10-11 18:11:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 312 states have internal predecessors, (342), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 356 transitions. [2024-10-11 18:11:02,815 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 356 transitions. Word has length 43 [2024-10-11 18:11:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:02,815 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 356 transitions. [2024-10-11 18:11:02,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 356 transitions. [2024-10-11 18:11:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:11:02,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:02,816 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:02,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 18:11:02,816 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:02,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2111671450, now seen corresponding path program 1 times [2024-10-11 18:11:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467956715] [2024-10-11 18:11:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:11:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467956715] [2024-10-11 18:11:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467956715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550798178] [2024-10-11 18:11:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:02,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:02,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:02,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:11:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:03,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:11:03,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:03,119 INFO L378 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 14 treesize of output 9 [2024-10-11 18:11:03,137 INFO L378 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 14 treesize of output 9 [2024-10-11 18:11:03,162 INFO L378 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 14 treesize of output 9 [2024-10-11 18:11:03,178 INFO L378 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 14 treesize of output 9 [2024-10-11 18:11:03,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:11:03,214 INFO L378 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 [2024-10-11 18:11:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:11:03,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:11:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550798178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:03,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:03,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-10-11 18:11:03,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155351951] [2024-10-11 18:11:03,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:03,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:11:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:11:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:11:03,322 INFO L87 Difference]: Start difference. First operand 315 states and 356 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:03,497 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2024-10-11 18:11:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:11:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 18:11:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:03,502 INFO L225 Difference]: With dead ends: 313 [2024-10-11 18:11:03,502 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 18:11:03,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:11:03,503 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 560 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:03,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 232 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 18:11:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-10-11 18:11:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 222 states have (on average 1.5225225225225225) internal successors, (338), 310 states have internal predecessors, (338), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 350 transitions. [2024-10-11 18:11:03,511 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 350 transitions. Word has length 44 [2024-10-11 18:11:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:03,511 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 350 transitions. [2024-10-11 18:11:03,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 350 transitions. [2024-10-11 18:11:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:11:03,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:03,516 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-11 18:11:03,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:11:03,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 18:11:03,717 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:03,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1492018021, now seen corresponding path program 1 times [2024-10-11 18:11:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:03,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180312284] [2024-10-11 18:11:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:11:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:03,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180312284] [2024-10-11 18:11:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180312284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:03,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:03,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:11:03,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600266171] [2024-10-11 18:11:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:03,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:11:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:11:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:11:03,851 INFO L87 Difference]: Start difference. First operand 313 states and 350 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 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) [2024-10-11 18:11:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:04,184 INFO L93 Difference]: Finished difference Result 342 states and 382 transitions. [2024-10-11 18:11:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:11:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 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 43 [2024-10-11 18:11:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:04,186 INFO L225 Difference]: With dead ends: 342 [2024-10-11 18:11:04,186 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 18:11:04,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:11:04,187 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 59 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:04,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 825 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:11:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 18:11:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 327. [2024-10-11 18:11:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 238 states have (on average 1.4831932773109244) internal successors, (353), 324 states have internal predecessors, (353), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 365 transitions. [2024-10-11 18:11:04,194 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 365 transitions. Word has length 43 [2024-10-11 18:11:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 365 transitions. [2024-10-11 18:11:04,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 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) [2024-10-11 18:11:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 365 transitions. [2024-10-11 18:11:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:11:04,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:04,195 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-11 18:11:04,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 18:11:04,196 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:04,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1492018020, now seen corresponding path program 1 times [2024-10-11 18:11:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:04,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298276129] [2024-10-11 18:11:04,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:04,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:04,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298276129] [2024-10-11 18:11:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298276129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:04,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:04,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:11:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266922948] [2024-10-11 18:11:04,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:11:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:11:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:11:04,478 INFO L87 Difference]: Start difference. First operand 327 states and 365 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:05,040 INFO L93 Difference]: Finished difference Result 355 states and 392 transitions. [2024-10-11 18:11:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:11:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-11 18:11:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:05,042 INFO L225 Difference]: With dead ends: 355 [2024-10-11 18:11:05,042 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 18:11:05,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:11:05,043 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 134 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:05,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1266 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:11:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 18:11:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 330. [2024-10-11 18:11:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 241 states have (on average 1.4771784232365146) internal successors, (356), 327 states have internal predecessors, (356), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 368 transitions. [2024-10-11 18:11:05,049 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 368 transitions. Word has length 43 [2024-10-11 18:11:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:05,049 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 368 transitions. [2024-10-11 18:11:05,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 368 transitions. [2024-10-11 18:11:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:11:05,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:05,050 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:05,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 18:11:05,050 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash -193878849, now seen corresponding path program 2 times [2024-10-11 18:11:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901608698] [2024-10-11 18:11:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901608698] [2024-10-11 18:11:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901608698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:05,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741589366] [2024-10-11 18:11:05,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:11:05,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:05,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:05,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:05,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:11:05,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 18:11:05,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:11:05,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:11:05,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:05,584 INFO L378 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 9 treesize of output 3 [2024-10-11 18:11:05,588 INFO L378 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 9 treesize of output 3 [2024-10-11 18:11:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:11:05,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:11:05,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741589366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:05,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:11:05,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-11 18:11:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991301693] [2024-10-11 18:11:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:05,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:11:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:11:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:11:05,606 INFO L87 Difference]: Start difference. First operand 330 states and 368 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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) [2024-10-11 18:11:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:05,835 INFO L93 Difference]: Finished difference Result 345 states and 384 transitions. [2024-10-11 18:11:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:11:05,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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 44 [2024-10-11 18:11:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:05,837 INFO L225 Difference]: With dead ends: 345 [2024-10-11 18:11:05,837 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 18:11:05,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:11:05,838 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 55 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:05,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 815 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 18:11:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 330. [2024-10-11 18:11:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 241 states have (on average 1.4730290456431536) internal successors, (355), 327 states have internal predecessors, (355), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 367 transitions. [2024-10-11 18:11:05,844 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 367 transitions. Word has length 44 [2024-10-11 18:11:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:05,844 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 367 transitions. [2024-10-11 18:11:05,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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) [2024-10-11 18:11:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 367 transitions. [2024-10-11 18:11:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 18:11:05,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:05,844 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:05,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:11:06,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:06,049 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:06,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash -91857341, now seen corresponding path program 1 times [2024-10-11 18:11:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:06,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914879423] [2024-10-11 18:11:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:11:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914879423] [2024-10-11 18:11:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914879423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:06,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:06,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:11:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791245609] [2024-10-11 18:11:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:06,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:11:06,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:06,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:11:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:11:06,253 INFO L87 Difference]: Start difference. First operand 330 states and 367 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 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) [2024-10-11 18:11:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:06,572 INFO L93 Difference]: Finished difference Result 336 states and 373 transitions. [2024-10-11 18:11:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:11:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 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 46 [2024-10-11 18:11:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:06,574 INFO L225 Difference]: With dead ends: 336 [2024-10-11 18:11:06,574 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 18:11:06,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:11:06,575 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 44 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:06,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1284 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 18:11:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 329. [2024-10-11 18:11:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 240 states have (on average 1.4708333333333334) internal successors, (353), 326 states have internal predecessors, (353), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 365 transitions. [2024-10-11 18:11:06,579 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 365 transitions. Word has length 46 [2024-10-11 18:11:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:06,579 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 365 transitions. [2024-10-11 18:11:06,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 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) [2024-10-11 18:11:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 365 transitions. [2024-10-11 18:11:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:11:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:06,580 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:06,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 18:11:06,580 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1160411704, now seen corresponding path program 2 times [2024-10-11 18:11:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047595871] [2024-10-11 18:11:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047595871] [2024-10-11 18:11:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047595871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577879658] [2024-10-11 18:11:06,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:11:06,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:06,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:11:06,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 18:11:06,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:11:06,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:11:06,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:11:07,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:11:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577879658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:07,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:11:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-10-11 18:11:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988432987] [2024-10-11 18:11:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:11:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:11:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:11:07,093 INFO L87 Difference]: Start difference. First operand 329 states and 365 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:07,322 INFO L93 Difference]: Finished difference Result 335 states and 371 transitions. [2024-10-11 18:11:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:11:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 18:11:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:07,323 INFO L225 Difference]: With dead ends: 335 [2024-10-11 18:11:07,323 INFO L226 Difference]: Without dead ends: 335 [2024-10-11 18:11:07,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:11:07,324 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 53 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:07,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 973 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:11:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-11 18:11:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 309. [2024-10-11 18:11:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 220 states have (on average 1.509090909090909) internal successors, (332), 306 states have internal predecessors, (332), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 344 transitions. [2024-10-11 18:11:07,327 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 344 transitions. Word has length 48 [2024-10-11 18:11:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:07,328 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 344 transitions. [2024-10-11 18:11:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 344 transitions. [2024-10-11 18:11:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 18:11:07,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:07,328 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:07,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:11:07,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-11 18:11:07,533 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1680021650, now seen corresponding path program 1 times [2024-10-11 18:11:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003808802] [2024-10-11 18:11:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:08,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:08,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003808802] [2024-10-11 18:11:08,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003808802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:08,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888440201] [2024-10-11 18:11:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:08,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:08,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:11:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:08,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 18:11:08,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:08,441 INFO L378 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 [2024-10-11 18:11:08,468 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:11:08,468 INFO L378 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 [2024-10-11 18:11:08,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:11:08,526 INFO L378 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 33 treesize of output 17 [2024-10-11 18:11:08,576 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-10-11 18:11:08,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-10-11 18:11:08,630 INFO L378 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 25 [2024-10-11 18:11:08,647 INFO L378 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 25 [2024-10-11 18:11:08,681 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2024-10-11 18:11:08,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 48 [2024-10-11 18:11:08,768 INFO L378 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 42 treesize of output 31 [2024-10-11 18:11:08,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:11:08,805 INFO L378 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 69 treesize of output 33 [2024-10-11 18:11:09,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:11:09,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:09,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 37 [2024-10-11 18:11:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:09,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:10,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:10,292 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:11:10,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-10-11 18:11:10,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:10,952 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 104 [2024-10-11 18:11:10,959 INFO L378 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 46 treesize of output 44 [2024-10-11 18:11:10,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:10,968 INFO L378 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 96 treesize of output 86 [2024-10-11 18:11:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888440201] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:16,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:16,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 40 [2024-10-11 18:11:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672494285] [2024-10-11 18:11:16,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:16,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 18:11:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 18:11:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1511, Unknown=2, NotChecked=0, Total=1640 [2024-10-11 18:11:16,310 INFO L87 Difference]: Start difference. First operand 309 states and 344 transitions. Second operand has 41 states, 40 states have (on average 3.475) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:20,705 INFO L93 Difference]: Finished difference Result 367 states and 401 transitions. [2024-10-11 18:11:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:11:20,706 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.475) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 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 49 [2024-10-11 18:11:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:20,707 INFO L225 Difference]: With dead ends: 367 [2024-10-11 18:11:20,707 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 18:11:20,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=349, Invalid=2619, Unknown=2, NotChecked=0, Total=2970 [2024-10-11 18:11:20,708 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 863 mSDsluCounter, 4026 mSDsCounter, 0 mSdLazyCounter, 3916 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 4231 SdHoareTripleChecker+Invalid, 3933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:20,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 4231 Invalid, 3933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3916 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 18:11:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 18:11:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 310. [2024-10-11 18:11:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 221 states have (on average 1.51131221719457) internal successors, (334), 307 states have internal predecessors, (334), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:11:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 346 transitions. [2024-10-11 18:11:20,716 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 346 transitions. Word has length 49 [2024-10-11 18:11:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:20,720 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 346 transitions. [2024-10-11 18:11:20,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.475) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 346 transitions. [2024-10-11 18:11:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 18:11:20,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:20,721 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:11:20,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:11:20,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 18:11:20,922 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2024-10-11 18:11:20,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1680021649, now seen corresponding path program 1 times [2024-10-11 18:11:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402634296] [2024-10-11 18:11:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402634296] [2024-10-11 18:11:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402634296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750613824] [2024-10-11 18:11:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:21,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:21,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:21,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:21,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:11:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:22,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 18:11:22,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:22,143 INFO L378 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 [2024-10-11 18:11:22,149 INFO L378 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 8 treesize of output 1 [2024-10-11 18:11:22,188 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:11:22,188 INFO L378 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 14 treesize of output 13 [2024-10-11 18:11:22,212 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:11:22,212 INFO L378 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 [2024-10-11 18:11:22,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:11:22,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:11:22,304 INFO L378 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 42 treesize of output 22 [2024-10-11 18:11:22,312 INFO L378 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 23 treesize of output 11 [2024-10-11 18:11:22,366 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:11:22,367 INFO L378 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:11:22,399 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-10-11 18:11:22,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-10-11 18:11:22,474 INFO L378 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 43 treesize of output 32 [2024-10-11 18:11:22,487 INFO L378 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 19 treesize of output 18 [2024-10-11 18:11:22,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 18:11:22,556 INFO L378 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 43 treesize of output 32 [2024-10-11 18:11:22,574 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-10-11 18:11:22,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 18:11:22,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:11:22,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-10-11 18:11:22,674 INFO L378 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 53 treesize of output 29 [2024-10-11 18:11:22,749 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:11:22,749 INFO L378 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 1 case distinctions, treesize of input 104 treesize of output 59 [2024-10-11 18:11:22,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:22,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-10-11 18:11:23,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:23,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:23,738 INFO L349 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2024-10-11 18:11:23,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 60 [2024-10-11 18:11:23,750 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:11:23,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2024-10-11 18:11:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:23,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:30,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:30,636 INFO L378 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 83494 treesize of output 82982 [2024-10-11 18:11:31,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 142 [2024-10-11 18:11:31,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:31,117 INFO L378 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 210918 treesize of output 210406 [2024-10-11 18:11:31,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:11:31,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:31,351 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 3308 treesize of output 3238 [2024-10-11 18:11:31,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:31,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1060 treesize of output 1060 [2024-10-11 18:11:33,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:11:33,584 INFO L378 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 1419 treesize of output 1403 [2024-10-11 18:11:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:11:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750613824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:50,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 44 [2024-10-11 18:11:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483671364] [2024-10-11 18:11:50,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:50,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 18:11:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 18:11:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1827, Unknown=5, NotChecked=0, Total=1980 [2024-10-11 18:11:50,168 INFO L87 Difference]: Start difference. First operand 310 states and 346 transitions. Second operand has 45 states, 44 states have (on average 3.25) internal successors, (143), 45 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:11:55,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 18:12:00,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]