./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:43:26,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:43:26,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:43:26,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:43:26,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:43:26,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:43:26,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:43:26,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:43:26,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:43:26,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:43:26,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:43:26,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:43:26,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:43:26,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:43:26,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:43:26,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:43:26,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:43:26,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:43:26,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:43:26,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:43:26,810 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:43:26,811 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:43:26,811 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:43:26,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:43:26,812 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:43:26,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:43:26,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:43:26,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:43:26,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:43:26,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:43:26,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:43:26,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:43:26,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:43:26,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:43:26,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:43:26,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:43:26,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:43:26,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:43:26,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:43:26,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:43:26,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:43:26,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:43:26,816 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2024-10-13 10:43:27,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:43:27,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:43:27,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:43:27,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:43:27,143 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:43:27,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-10-13 10:43:28,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:43:28,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:43:28,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2024-10-13 10:43:28,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0a39be4/52a9cebbd747429f843f3c95ca383881/FLAG9dc0c26dc [2024-10-13 10:43:28,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0a39be4/52a9cebbd747429f843f3c95ca383881 [2024-10-13 10:43:28,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:43:28,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:43:28,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:43:28,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:43:28,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:43:28,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:28" (1/1) ... [2024-10-13 10:43:28,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b43ea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:28, skipping insertion in model container [2024-10-13 10:43:28,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:28" (1/1) ... [2024-10-13 10:43:29,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:43:29,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:43:29,437 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:43:29,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:43:29,519 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:43:29,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29 WrapperNode [2024-10-13 10:43:29,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:43:29,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:43:29,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:43:29,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:43:29,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,592 INFO L138 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 367 [2024-10-13 10:43:29,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:43:29,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:43:29,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:43:29,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:43:29,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,660 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2024-10-13 10:43:29,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:43:29,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:43:29,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:43:29,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:43:29,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (1/1) ... [2024-10-13 10:43:29,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:43:29,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:29,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:43:29,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:43:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:43:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:43:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 10:43:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:43:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:43:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:43:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:43:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:43:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:43:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:43:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:43:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:43:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:43:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:43:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:43:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:43:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:43:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:43:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:43:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:43:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-13 10:43:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-13 10:43:29,968 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:43:29,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:43:30,757 INFO L? ?]: Removed 360 outVars from TransFormulas that were not future-live. [2024-10-13 10:43:30,758 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:43:30,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:43:30,830 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-13 10:43:30,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:30 BoogieIcfgContainer [2024-10-13 10:43:30,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:43:30,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:43:30,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:43:30,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:43:30,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:43:28" (1/3) ... [2024-10-13 10:43:30,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580ed9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:30, skipping insertion in model container [2024-10-13 10:43:30,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:29" (2/3) ... [2024-10-13 10:43:30,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580ed9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:30, skipping insertion in model container [2024-10-13 10:43:30,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:30" (3/3) ... [2024-10-13 10:43:30,838 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2024-10-13 10:43:30,853 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:43:30,854 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2024-10-13 10:43:30,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:43:30,925 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;@7cc136df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:43:30,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-10-13 10:43:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 130 states have (on average 2.4) internal successors, (312), 279 states have internal predecessors, (312), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:43:30,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:30,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:43:30,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:30,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 18449, now seen corresponding path program 1 times [2024-10-13 10:43:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:30,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772978032] [2024-10-13 10:43:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:31,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-13 10:43:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772978032] [2024-10-13 10:43:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772978032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:43:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973846689] [2024-10-13 10:43:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:31,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:31,159 INFO L87 Difference]: Start difference. First operand has 293 states, 130 states have (on average 2.4) internal successors, (312), 279 states have internal predecessors, (312), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-13 10:43:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:31,711 INFO L93 Difference]: Finished difference Result 498 states and 552 transitions. [2024-10-13 10:43:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:31,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-13 10:43:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:31,729 INFO L225 Difference]: With dead ends: 498 [2024-10-13 10:43:31,730 INFO L226 Difference]: Without dead ends: 497 [2024-10-13 10:43:31,732 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-13 10:43:31,737 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 221 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:31,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 374 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:43:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-13 10:43:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 364. [2024-10-13 10:43:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 204 states have (on average 2.3186274509803924) internal successors, (473), 350 states have internal predecessors, (473), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 501 transitions. [2024-10-13 10:43:31,807 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 501 transitions. Word has length 2 [2024-10-13 10:43:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:31,808 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 501 transitions. [2024-10-13 10:43:31,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-13 10:43:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 501 transitions. [2024-10-13 10:43:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:43:31,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:31,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:43:31,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:43:31,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:31,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 18450, now seen corresponding path program 1 times [2024-10-13 10:43:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660458364] [2024-10-13 10:43:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:31,892 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-13 10:43:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660458364] [2024-10-13 10:43:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660458364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:43:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656461202] [2024-10-13 10:43:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:31,898 INFO L87 Difference]: Start difference. First operand 364 states and 501 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-13 10:43:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:32,105 INFO L93 Difference]: Finished difference Result 365 states and 504 transitions. [2024-10-13 10:43:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-13 10:43:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:32,108 INFO L225 Difference]: With dead ends: 365 [2024-10-13 10:43:32,109 INFO L226 Difference]: Without dead ends: 365 [2024-10-13 10:43:32,110 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-13 10:43:32,111 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:32,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 471 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:43:32,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-13 10:43:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-10-13 10:43:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 204 states have (on average 2.3088235294117645) internal successors, (471), 348 states have internal predecessors, (471), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 499 transitions. [2024-10-13 10:43:32,144 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 499 transitions. Word has length 2 [2024-10-13 10:43:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:32,145 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 499 transitions. [2024-10-13 10:43:32,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-13 10:43:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 499 transitions. [2024-10-13 10:43:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:43:32,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:32,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:32,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:43:32,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:32,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1425818485, now seen corresponding path program 1 times [2024-10-13 10:43:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:32,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110489542] [2024-10-13 10:43:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:32,295 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-13 10:43:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110489542] [2024-10-13 10:43:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110489542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:32,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:32,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:43:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438373401] [2024-10-13 10:43:32,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:32,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:32,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:32,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:32,298 INFO L87 Difference]: Start difference. First operand 362 states and 499 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-13 10:43:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:32,486 INFO L93 Difference]: Finished difference Result 357 states and 494 transitions. [2024-10-13 10:43:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-13 10:43:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:32,490 INFO L225 Difference]: With dead ends: 357 [2024-10-13 10:43:32,490 INFO L226 Difference]: Without dead ends: 357 [2024-10-13 10:43:32,490 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-13 10:43:32,491 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:32,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:43:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-13 10:43:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-13 10:43:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 204 states have (on average 2.284313725490196) internal successors, (466), 343 states have internal predecessors, (466), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-10-13 10:43:32,507 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 8 [2024-10-13 10:43:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:32,507 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-10-13 10:43:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-13 10:43:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-10-13 10:43:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:43:32,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:32,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:32,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:43:32,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1425818484, now seen corresponding path program 1 times [2024-10-13 10:43:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:32,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15457695] [2024-10-13 10:43:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:32,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:32,637 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-13 10:43:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:32,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15457695] [2024-10-13 10:43:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15457695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:43:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091432302] [2024-10-13 10:43:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:32,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:43:32,639 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-13 10:43:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:32,840 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-10-13 10:43:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-13 10:43:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:32,843 INFO L225 Difference]: With dead ends: 352 [2024-10-13 10:43:32,843 INFO L226 Difference]: Without dead ends: 352 [2024-10-13 10:43:32,844 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-13 10:43:32,845 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:32,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 437 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:43:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-13 10:43:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-13 10:43:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 204 states have (on average 2.2598039215686274) internal successors, (461), 338 states have internal predecessors, (461), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-10-13 10:43:32,859 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 8 [2024-10-13 10:43:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-10-13 10:43:32,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-13 10:43:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-10-13 10:43:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:43:32,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:32,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:32,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:43:32,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:32,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1250699647, now seen corresponding path program 1 times [2024-10-13 10:43:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195618306] [2024-10-13 10:43:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:33,028 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-13 10:43:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:33,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195618306] [2024-10-13 10:43:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195618306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:33,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:33,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:43:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850681325] [2024-10-13 10:43:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:33,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:43:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:43:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:43:33,033 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-13 10:43:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:33,548 INFO L93 Difference]: Finished difference Result 474 states and 526 transitions. [2024-10-13 10:43:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:43:33,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-13 10:43:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:33,551 INFO L225 Difference]: With dead ends: 474 [2024-10-13 10:43:33,551 INFO L226 Difference]: Without dead ends: 474 [2024-10-13 10:43:33,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:43:33,553 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 288 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:33,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 529 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:43:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-13 10:43:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 344. [2024-10-13 10:43:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 204 states have (on average 2.2205882352941178) internal successors, (453), 330 states have internal predecessors, (453), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2024-10-13 10:43:33,569 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 9 [2024-10-13 10:43:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:33,569 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2024-10-13 10:43:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-13 10:43:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2024-10-13 10:43:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:43:33,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:33,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:33,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:43:33,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:33,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1250699646, now seen corresponding path program 1 times [2024-10-13 10:43:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614671455] [2024-10-13 10:43:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:33,793 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-13 10:43:33,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:33,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614671455] [2024-10-13 10:43:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614671455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:33,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:33,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:43:33,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73056100] [2024-10-13 10:43:33,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:33,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:43:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:33,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:43:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:43:33,798 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-13 10:43:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:34,505 INFO L93 Difference]: Finished difference Result 466 states and 517 transitions. [2024-10-13 10:43:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:43:34,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-13 10:43:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:34,508 INFO L225 Difference]: With dead ends: 466 [2024-10-13 10:43:34,508 INFO L226 Difference]: Without dead ends: 466 [2024-10-13 10:43:34,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:43:34,509 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 487 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:34,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 344 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:43:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-13 10:43:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 335. [2024-10-13 10:43:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 204 states have (on average 2.1715686274509802) internal successors, (443), 321 states have internal predecessors, (443), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:43:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 471 transitions. [2024-10-13 10:43:34,518 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 471 transitions. Word has length 9 [2024-10-13 10:43:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:34,518 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 471 transitions. [2024-10-13 10:43:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-13 10:43:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 471 transitions. [2024-10-13 10:43:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:43:34,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:34,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:34,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:43:34,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:34,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1278972761, now seen corresponding path program 1 times [2024-10-13 10:43:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154675145] [2024-10-13 10:43:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:34,820 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-13 10:43:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:34,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154675145] [2024-10-13 10:43:34,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154675145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:34,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:43:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647276236] [2024-10-13 10:43:34,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:34,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:43:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:43:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:43:34,823 INFO L87 Difference]: Start difference. First operand 335 states and 471 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-13 10:43:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:35,029 INFO L93 Difference]: Finished difference Result 353 states and 492 transitions. [2024-10-13 10:43:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:43:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2024-10-13 10:43:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:35,031 INFO L225 Difference]: With dead ends: 353 [2024-10-13 10:43:35,031 INFO L226 Difference]: Without dead ends: 353 [2024-10-13 10:43:35,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:43:35,032 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 27 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:35,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1266 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:43:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-13 10:43:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 342. [2024-10-13 10:43:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 210 states have (on average 2.142857142857143) internal successors, (450), 327 states have internal predecessors, (450), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 10:43:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2024-10-13 10:43:35,045 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 16 [2024-10-13 10:43:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:35,046 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2024-10-13 10:43:35,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-13 10:43:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2024-10-13 10:43:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:43:35,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:35,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:35,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:43:35,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash 209392947, now seen corresponding path program 1 times [2024-10-13 10:43:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789978688] [2024-10-13 10:43:35,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:35,311 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-13 10:43:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789978688] [2024-10-13 10:43:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789978688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:43:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:43:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56468188] [2024-10-13 10:43:35,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:43:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:43:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:43:35,312 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) 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-13 10:43:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:35,526 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2024-10-13 10:43:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:43:35,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) 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-13 10:43:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:35,528 INFO L225 Difference]: With dead ends: 346 [2024-10-13 10:43:35,528 INFO L226 Difference]: Without dead ends: 346 [2024-10-13 10:43:35,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:43:35,529 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 9 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:35,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1270 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:43:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-13 10:43:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2024-10-13 10:43:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 212 states have (on average 2.1320754716981134) internal successors, (452), 329 states have internal predecessors, (452), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 10:43:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 482 transitions. [2024-10-13 10:43:35,538 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 482 transitions. Word has length 17 [2024-10-13 10:43:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:35,539 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 482 transitions. [2024-10-13 10:43:35,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) 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-13 10:43:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 482 transitions. [2024-10-13 10:43:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:43:35,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:35,540 INFO L215 NwaCegarLoop]: trace histogram [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-13 10:43:35,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:43:35,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:35,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash -625484592, now seen corresponding path program 1 times [2024-10-13 10:43:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656039661] [2024-10-13 10:43:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:43:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:43:36,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656039661] [2024-10-13 10:43:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656039661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655782613] [2024-10-13 10:43:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:36,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:36,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:43:36,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:43:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:36,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 10:43:36,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:36,398 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 13 treesize of output 9 [2024-10-13 10:43:36,461 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-13 10:43:36,616 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 0 case distinctions, treesize of input 17 treesize of output 20 [2024-10-13 10:43:36,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-13 10:43:36,679 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 7 treesize of output 3 [2024-10-13 10:43:36,710 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-13 10:43:36,710 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 20 [2024-10-13 10:43:36,750 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 21 treesize of output 9 [2024-10-13 10:43:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:43:36,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:36,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:43:36,887 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 19 treesize of output 23 [2024-10-13 10:43:36,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= c_append_~node~0.base (select v_arrayElimArr_2 (+ c_append_~head.offset 4)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| c_append_~head.base v_arrayElimArr_2) |c_append_#in~head.base|) (+ 4 |c_append_#in~head.offset|))) 1))) is different from false [2024-10-13 10:43:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-13 10:43:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655782613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:36,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:36,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 17 [2024-10-13 10:43:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491688264] [2024-10-13 10:43:36,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:36,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:43:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:43:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=227, Unknown=1, NotChecked=30, Total=306 [2024-10-13 10:43:36,947 INFO L87 Difference]: Start difference. First operand 344 states and 482 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:43:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:38,256 INFO L93 Difference]: Finished difference Result 474 states and 528 transitions. [2024-10-13 10:43:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:43:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-13 10:43:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:38,259 INFO L225 Difference]: With dead ends: 474 [2024-10-13 10:43:38,259 INFO L226 Difference]: Without dead ends: 474 [2024-10-13 10:43:38,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=367, Unknown=1, NotChecked=40, Total=506 [2024-10-13 10:43:38,261 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 285 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:38,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1439 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1610 Invalid, 0 Unknown, 399 Unchecked, 1.1s Time] [2024-10-13 10:43:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-13 10:43:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 343. [2024-10-13 10:43:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 212 states have (on average 2.1273584905660377) internal successors, (451), 328 states have internal predecessors, (451), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 10:43:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 481 transitions. [2024-10-13 10:43:38,273 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 481 transitions. Word has length 31 [2024-10-13 10:43:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:38,273 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 481 transitions. [2024-10-13 10:43:38,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:43:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 481 transitions. [2024-10-13 10:43:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:43:38,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:38,275 INFO L215 NwaCegarLoop]: trace histogram [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-13 10:43:38,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:43:38,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:38,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:38,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash -625484591, now seen corresponding path program 1 times [2024-10-13 10:43:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243474413] [2024-10-13 10:43:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:39,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:43:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:43:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243474413] [2024-10-13 10:43:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243474413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9444962] [2024-10-13 10:43:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:39,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:43:39,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:43:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:39,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-13 10:43:39,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:39,605 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 13 treesize of output 9 [2024-10-13 10:43:39,643 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-13 10:43:39,659 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-13 10:43:39,828 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 0 case distinctions, treesize of input 11 treesize of output 14 [2024-10-13 10:43:39,840 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 19 treesize of output 1 [2024-10-13 10:43:39,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-13 10:43:39,919 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 7 treesize of output 3 [2024-10-13 10:43:39,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:43:39,964 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 20 treesize of output 15 [2024-10-13 10:43:39,976 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-13 10:43:39,976 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 17 treesize of output 17 [2024-10-13 10:43:40,023 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 21 treesize of output 9 [2024-10-13 10:43:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:43:40,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:40,542 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 76 treesize of output 70 [2024-10-13 10:43:40,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:43:40,834 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 19 treesize of output 23 [2024-10-13 10:43:41,291 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 126 treesize of output 124 [2024-10-13 10:43:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:43:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9444962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:41,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 6] total 20 [2024-10-13 10:43:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700510845] [2024-10-13 10:43:41,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:43:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:43:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:43:41,301 INFO L87 Difference]: Start difference. First operand 343 states and 481 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:43:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:44,130 INFO L93 Difference]: Finished difference Result 477 states and 543 transitions. [2024-10-13 10:43:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:43:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-13 10:43:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:44,133 INFO L225 Difference]: With dead ends: 477 [2024-10-13 10:43:44,134 INFO L226 Difference]: Without dead ends: 477 [2024-10-13 10:43:44,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:43:44,135 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 493 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:44,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1339 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3207 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 10:43:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-13 10:43:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 344. [2024-10-13 10:43:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 213 states have (on average 2.1173708920187795) internal successors, (451), 329 states have internal predecessors, (451), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (29), 14 states have call predecessors, (29), 15 states have call successors, (29) [2024-10-13 10:43:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 495 transitions. [2024-10-13 10:43:44,153 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 495 transitions. Word has length 31 [2024-10-13 10:43:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:44,153 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 495 transitions. [2024-10-13 10:43:44,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:43:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 495 transitions. [2024-10-13 10:43:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-13 10:43:44,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:44,160 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 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, 1, 1, 1] [2024-10-13 10:43:44,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:43:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 10:43:44,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:44,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -990388702, now seen corresponding path program 1 times [2024-10-13 10:43:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379273722] [2024-10-13 10:43:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:43:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 10:43:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 10:43:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 10:43:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 10:43:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 10:43:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 10:43:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 10:43:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 10:43:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 10:43:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 10:43:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 10:43:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 10:43:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 10:43:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 49 proven. 119 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-10-13 10:43:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379273722] [2024-10-13 10:43:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379273722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531517134] [2024-10-13 10:43:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:44,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:43:44,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:43:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:45,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:43:45,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-10-13 10:43:45,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:43:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531517134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:43:45,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:43:45,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-13 10:43:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244242459] [2024-10-13 10:43:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:43:45,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:43:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:45,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:43:45,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:43:45,355 INFO L87 Difference]: Start difference. First operand 344 states and 495 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 10:43:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:45,412 INFO L93 Difference]: Finished difference Result 345 states and 496 transitions. [2024-10-13 10:43:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:43:45,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 186 [2024-10-13 10:43:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:45,414 INFO L225 Difference]: With dead ends: 345 [2024-10-13 10:43:45,415 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 10:43:45,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:43:45,416 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:45,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:43:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 10:43:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-10-13 10:43:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 214 states have (on average 2.1121495327102804) internal successors, (452), 330 states have internal predecessors, (452), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (29), 14 states have call predecessors, (29), 15 states have call successors, (29) [2024-10-13 10:43:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 496 transitions. [2024-10-13 10:43:45,431 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 496 transitions. Word has length 186 [2024-10-13 10:43:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:45,431 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 496 transitions. [2024-10-13 10:43:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 10:43:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 496 transitions. [2024-10-13 10:43:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 10:43:45,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:45,437 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 1] [2024-10-13 10:43:45,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:43:45,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:45,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 922237530, now seen corresponding path program 1 times [2024-10-13 10:43:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:45,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055447888] [2024-10-13 10:43:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:43:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 10:43:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:43:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 10:43:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 10:43:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 10:43:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 10:43:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 10:43:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 10:43:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 10:43:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 10:43:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 10:43:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 10:43:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 10:43:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2024-10-13 10:43:47,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:43:47,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055447888] [2024-10-13 10:43:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055447888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:43:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416326116] [2024-10-13 10:43:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:47,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:47,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:43:47,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:43:47,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:43:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:47,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:43:47,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:43:47,786 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 19 treesize of output 1 [2024-10-13 10:43:47,863 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-13 10:43:47,869 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 10 treesize of output 4 [2024-10-13 10:43:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 704 proven. 11 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-13 10:43:47,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:43:47,991 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 10 treesize of output 4 [2024-10-13 10:43:48,010 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 10 treesize of output 4 [2024-10-13 10:43:48,106 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 32 treesize of output 26 [2024-10-13 10:43:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 116 proven. 172 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-10-13 10:43:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416326116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:43:48,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:43:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2024-10-13 10:43:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219044676] [2024-10-13 10:43:48,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:43:48,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:43:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:43:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:43:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:43:48,170 INFO L87 Difference]: Start difference. First operand 345 states and 496 transitions. Second operand has 20 states, 20 states have (on average 4.35) internal successors, (87), 17 states have internal predecessors, (87), 4 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-13 10:43:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:43:48,821 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2024-10-13 10:43:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:43:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 17 states have internal predecessors, (87), 4 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 199 [2024-10-13 10:43:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:43:48,822 INFO L225 Difference]: With dead ends: 345 [2024-10-13 10:43:48,823 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 10:43:48,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 10:43:48,824 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 519 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:43:48,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2252 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:43:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 10:43:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-10-13 10:43:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 212 states have (on average 2.1132075471698113) internal successors, (448), 328 states have internal predecessors, (448), 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-13 10:43:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 478 transitions. [2024-10-13 10:43:48,832 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 478 transitions. Word has length 199 [2024-10-13 10:43:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:43:48,832 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 478 transitions. [2024-10-13 10:43:48,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 17 states have internal predecessors, (87), 4 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-13 10:43:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 478 transitions. [2024-10-13 10:43:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 10:43:48,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:43:48,835 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:43:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:43:49,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:43:49,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:43:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:43:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 143444314, now seen corresponding path program 1 times [2024-10-13 10:43:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:43:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44214861] [2024-10-13 10:43:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:43:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:43:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:58,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:43:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 10:43:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 10:43:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 10:43:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 10:43:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 10:43:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 10:43:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 10:43:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:43:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 10:43:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 10:44:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 10:44:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 10:44:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 10:44:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-13 10:44:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 13 proven. 65 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-13 10:44:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44214861] [2024-10-13 10:44:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44214861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390912065] [2024-10-13 10:44:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:00,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:00,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:44:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:01,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 283 conjuncts are in the unsatisfiable core [2024-10-13 10:44:01,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:01,310 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-13 10:44:01,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-10-13 10:44:01,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:01,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 16 [2024-10-13 10:44:01,678 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-10-13 10:44:01,678 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 22 treesize of output 24 [2024-10-13 10:44:01,684 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 29 treesize of output 13 [2024-10-13 10:44:01,856 INFO L349 Elim1Store]: treesize reduction 86, result has 37.2 percent of original size [2024-10-13 10:44:01,856 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 3 case distinctions, treesize of input 41 treesize of output 57 [2024-10-13 10:44:01,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:01,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 70 treesize of output 38 [2024-10-13 10:44:02,068 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-13 10:44:02,068 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 44 treesize of output 41 [2024-10-13 10:44:02,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:02,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 71 treesize of output 35 [2024-10-13 10:44:02,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:02,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 54 treesize of output 22 [2024-10-13 10:44:02,429 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-10-13 10:44:02,430 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 3 case distinctions, treesize of input 29 treesize of output 54 [2024-10-13 10:44:02,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 10:44:02,602 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-13 10:44:02,603 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 16 treesize of output 18 [2024-10-13 10:44:02,704 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-13 10:44:02,704 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 30 treesize of output 27 [2024-10-13 10:44:02,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-10-13 10:44:02,828 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-13 10:44:02,828 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 44 treesize of output 41 [2024-10-13 10:44:02,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 71 treesize of output 35 [2024-10-13 10:44:02,981 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-10-13 10:44:02,982 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 3 case distinctions, treesize of input 49 treesize of output 71 [2024-10-13 10:44:02,986 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 0 case distinctions, treesize of input 83 treesize of output 43 [2024-10-13 10:44:03,156 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-10-13 10:44:03,156 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 3 case distinctions, treesize of input 49 treesize of output 71 [2024-10-13 10:44:03,165 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 0 case distinctions, treesize of input 83 treesize of output 43 [2024-10-13 10:44:03,462 INFO L349 Elim1Store]: treesize reduction 82, result has 41.0 percent of original size [2024-10-13 10:44:03,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 80 [2024-10-13 10:44:03,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:03,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 89 treesize of output 49 [2024-10-13 10:44:03,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:03,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 50 treesize of output 22 [2024-10-13 10:44:03,641 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-10-13 10:44:03,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 21 treesize of output 26 [2024-10-13 10:44:03,816 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_append_~head.offset_93 Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_append_#in~head.base| (let ((.cse0 (+ v_append_~head.offset_93 4))) (store (select |c_old(#memory_$Pointer$#1.base)| |c_append_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_append_#in~head.base|) .cse0))))) (<= |c_append_#in~head.offset| v_append_~head.offset_93))) (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-10-13 10:44:03,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:03,836 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 29 treesize of output 13 [2024-10-13 10:44:03,877 INFO L349 Elim1Store]: treesize reduction 120, result has 17.2 percent of original size [2024-10-13 10:44:03,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 42 [2024-10-13 10:44:03,951 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 17 treesize of output 9 [2024-10-13 10:44:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 294 proven. 545 refuted. 0 times theorem prover too weak. 240 trivial. 26 not checked. [2024-10-13 10:44:03,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:16,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390912065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:16,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:44:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 37] total 44 [2024-10-13 10:44:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46309828] [2024-10-13 10:44:16,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:16,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-13 10:44:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 10:44:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2351, Unknown=4, NotChecked=100, Total=2756 [2024-10-13 10:44:16,873 INFO L87 Difference]: Start difference. First operand 343 states and 478 transitions. Second operand has 45 states, 40 states have (on average 3.35) internal successors, (134), 38 states have internal predecessors, (134), 8 states have call successors, (28), 4 states have call predecessors, (28), 11 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-10-13 10:44:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:19,339 INFO L93 Difference]: Finished difference Result 473 states and 528 transitions. [2024-10-13 10:44:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:44:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 3.35) internal successors, (134), 38 states have internal predecessors, (134), 8 states have call successors, (28), 4 states have call predecessors, (28), 11 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 212 [2024-10-13 10:44:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:19,342 INFO L225 Difference]: With dead ends: 473 [2024-10-13 10:44:19,342 INFO L226 Difference]: Without dead ends: 473 [2024-10-13 10:44:19,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 251 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=603, Invalid=3819, Unknown=4, NotChecked=130, Total=4556 [2024-10-13 10:44:19,345 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1610 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 144 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:44:19,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1727 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2333 Invalid, 1 Unknown, 522 Unchecked, 1.9s Time] [2024-10-13 10:44:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-13 10:44:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 342. [2024-10-13 10:44:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 217 states have (on average 2.0829493087557602) internal successors, (452), 327 states have internal predecessors, (452), 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-13 10:44:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 482 transitions. [2024-10-13 10:44:19,354 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 482 transitions. Word has length 212 [2024-10-13 10:44:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:19,355 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 482 transitions. [2024-10-13 10:44:19,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 3.35) internal successors, (134), 38 states have internal predecessors, (134), 8 states have call successors, (28), 4 states have call predecessors, (28), 11 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-10-13 10:44:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 482 transitions. [2024-10-13 10:44:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 10:44:19,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:19,358 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:19,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:44:19,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 10:44:19,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-13 10:44:19,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 143444315, now seen corresponding path program 1 times [2024-10-13 10:44:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702045926] [2024-10-13 10:44:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 10:44:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 10:44:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 10:44:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 10:44:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 10:44:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 10:44:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 10:44:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 10:44:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 10:44:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 10:44:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 10:44:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 10:44:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 10:44:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-13 10:44:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-10-13 10:44:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702045926] [2024-10-13 10:44:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702045926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233075144] [2024-10-13 10:44:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:32,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:32,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:44:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:33,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 359 conjuncts are in the unsatisfiable core [2024-10-13 10:44:33,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:33,137 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-13 10:44:33,144 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-13 10:44:33,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-10-13 10:44:33,179 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 21 treesize of output 20 [2024-10-13 10:44:33,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:33,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 14 [2024-10-13 10:44:33,506 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 0 case distinctions, treesize of input 55 treesize of output 21 [2024-10-13 10:44:33,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-10-13 10:44:33,967 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-13 10:44:33,969 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 23 treesize of output 24 [2024-10-13 10:44:33,975 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 18 treesize of output 13 [2024-10-13 10:44:33,985 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 27 treesize of output 11 [2024-10-13 10:44:34,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-10-13 10:44:34,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:34,253 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 18 treesize of output 13 [2024-10-13 10:44:34,269 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-13 10:44:34,269 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 23 treesize of output 24 [2024-10-13 10:44:34,274 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 27 treesize of output 11 [2024-10-13 10:44:34,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:44:34,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:34,533 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 30 treesize of output 13 [2024-10-13 10:44:34,557 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2024-10-13 10:44:34,558 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 41 treesize of output 30 [2024-10-13 10:44:34,563 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 52 treesize of output 28 [2024-10-13 10:44:35,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:44:35,056 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-10-13 10:44:35,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 33 treesize of output 41 [2024-10-13 10:44:35,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 13 [2024-10-13 10:44:35,067 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 0 case distinctions, treesize of input 77 treesize of output 37 [2024-10-13 10:44:35,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:44:35,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 71 treesize of output 31 [2024-10-13 10:44:35,442 INFO L349 Elim1Store]: treesize reduction 80, result has 31.0 percent of original size [2024-10-13 10:44:35,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2024-10-13 10:44:35,447 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-13 10:44:35,463 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 27 treesize of output 11 [2024-10-13 10:44:35,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:35,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 13 [2024-10-13 10:44:35,802 INFO L349 Elim1Store]: treesize reduction 134, result has 28.7 percent of original size [2024-10-13 10:44:35,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 66 [2024-10-13 10:44:35,809 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 68 treesize of output 36 [2024-10-13 10:44:35,827 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 27 treesize of output 11 [2024-10-13 10:44:36,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:44:36,214 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 0 case distinctions, treesize of input 88 treesize of output 38 [2024-10-13 10:44:36,246 INFO L349 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2024-10-13 10:44:36,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2024-10-13 10:44:36,251 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 18 treesize of output 13 [2024-10-13 10:44:36,550 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-13 10:44:36,551 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 30 treesize of output 27 [2024-10-13 10:44:36,553 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 23 [2024-10-13 10:44:36,561 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 27 treesize of output 11 [2024-10-13 10:44:36,613 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-13 10:44:37,021 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 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-13 10:44:37,028 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 0 case distinctions, treesize of input 49 treesize of output 21 [2024-10-13 10:44:37,049 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-10-13 10:44:37,050 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 38 treesize of output 35 [2024-10-13 10:44:37,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:37,446 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2024-10-13 10:44:37,446 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 5 case distinctions, treesize of input 46 treesize of output 71 [2024-10-13 10:44:37,452 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 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-13 10:44:37,460 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-13 10:44:37,460 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 17 treesize of output 17 [2024-10-13 10:44:37,491 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 27 treesize of output 11 [2024-10-13 10:44:37,951 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 0 case distinctions, treesize of input 72 treesize of output 34 [2024-10-13 10:44:37,997 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-13 10:44:37,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 31 treesize of output 53 [2024-10-13 10:44:38,004 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 0 case distinctions, treesize of input 49 treesize of output 21 [2024-10-13 10:44:38,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:44:38,546 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 107 treesize of output 83 [2024-10-13 10:44:39,166 INFO L349 Elim1Store]: treesize reduction 116, result has 77.9 percent of original size [2024-10-13 10:44:39,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 96 treesize of output 469