./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0218.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:18:54,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:18:54,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:18:54,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:18:54,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:18:54,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:18:54,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:18:54,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:18:54,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:18:54,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:18:54,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:18:54,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:18:54,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:18:54,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:18:54,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:18:54,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:18:54,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:18:54,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:18:54,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:18:54,268 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2025-01-09 22:18:54,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:18:54,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:18:54,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:18:54,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:18:54,443 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:18:54,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2025-01-09 22:18:55,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b668b2a1c/6c5b4edc3ffa4d56bbd1cc07d5e1cd28/FLAG9e3377891 [2025-01-09 22:18:55,833 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:18:55,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2025-01-09 22:18:55,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b668b2a1c/6c5b4edc3ffa4d56bbd1cc07d5e1cd28/FLAG9e3377891 [2025-01-09 22:18:56,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b668b2a1c/6c5b4edc3ffa4d56bbd1cc07d5e1cd28 [2025-01-09 22:18:56,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:18:56,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:18:56,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:18:56,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:18:56,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:18:56,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b755c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56, skipping insertion in model container [2025-01-09 22:18:56,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:18:56,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:18:56,391 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:18:56,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:18:56,465 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:18:56,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56 WrapperNode [2025-01-09 22:18:56,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:18:56,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:18:56,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:18:56,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:18:56,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,508 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2025-01-09 22:18:56,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:18:56,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:18:56,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:18:56,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:18:56,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,542 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-01-09 22:18:56,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:18:56,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:18:56,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:18:56,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:18:56,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (1/1) ... [2025-01-09 22:18:56,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:18:56,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:18:56,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:18:56,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:18:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-01-09 22:18:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-01-09 22:18:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:18:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:18:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:18:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:18:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:18:56,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:18:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:18:56,689 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:18:56,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:18:56,986 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-01-09 22:18:56,986 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:18:56,997 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:18:56,999 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 22:18:56,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:18:56 BoogieIcfgContainer [2025-01-09 22:18:57,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:18:57,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:18:57,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:18:57,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:18:57,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:18:56" (1/3) ... [2025-01-09 22:18:57,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d16038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:18:57, skipping insertion in model container [2025-01-09 22:18:57,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:18:56" (2/3) ... [2025-01-09 22:18:57,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d16038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:18:57, skipping insertion in model container [2025-01-09 22:18:57,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:18:56" (3/3) ... [2025-01-09 22:18:57,008 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0218.i [2025-01-09 22:18:57,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:18:57,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0218.i that has 2 procedures, 162 locations, 1 initial locations, 6 loop locations, and 65 error locations. [2025-01-09 22:18:57,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:18:57,058 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;@39332ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:18:57,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-01-09 22:18:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 93 states have (on average 1.956989247311828) internal successors, (182), 158 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:18:57,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1074364904, now seen corresponding path program 1 times [2025-01-09 22:18:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-01-09 22:18:57,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:18:57,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:18:57,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711340295] [2025-01-09 22:18:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711340295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:18:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62568659] [2025-01-09 22:18:57,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:18:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:18:57,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:18:57,214 INFO L87 Difference]: Start difference. First operand has 162 states, 93 states have (on average 1.956989247311828) internal successors, (182), 158 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:57,232 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2025-01-09 22:18:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:18:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-01-09 22:18:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:57,239 INFO L225 Difference]: With dead ends: 162 [2025-01-09 22:18:57,239 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:18:57,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:18:57,242 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:57,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:18:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:18:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-09 22:18:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 92 states have (on average 1.9021739130434783) internal successors, (175), 156 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:18:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-01-09 22:18:57,280 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 6 [2025-01-09 22:18:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-01-09 22:18:57,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-01-09 22:18:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:18:57,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:18:57,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:57,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1281229865, now seen corresponding path program 1 times [2025-01-09 22:18:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296065929] [2025-01-09 22:18:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:18:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:18:57,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:57,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296065929] [2025-01-09 22:18:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296065929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:18:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140853716] [2025-01-09 22:18:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:18:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:18:57,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:18:57,410 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:57,560 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2025-01-09 22:18:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:18:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:18:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:57,563 INFO L225 Difference]: With dead ends: 311 [2025-01-09 22:18:57,563 INFO L226 Difference]: Without dead ends: 311 [2025-01-09 22:18:57,563 INFO L434 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 [2025-01-09 22:18:57,563 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 160 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:57,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-09 22:18:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 222. [2025-01-09 22:18:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 151 states have (on average 1.8741721854304636) internal successors, (283), 215 states have internal predecessors, (283), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:18:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2025-01-09 22:18:57,574 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 7 [2025-01-09 22:18:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2025-01-09 22:18:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2025-01-09 22:18:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:18:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:18:57,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1281229864, now seen corresponding path program 1 times [2025-01-09 22:18:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855295029] [2025-01-09 22:18:57,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:18:57,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:18:57,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855295029] [2025-01-09 22:18:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855295029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:18:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338960701] [2025-01-09 22:18:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:18:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:18:57,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:57,659 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:57,753 INFO L93 Difference]: Finished difference Result 225 states and 294 transitions. [2025-01-09 22:18:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:18:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:18:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:57,755 INFO L225 Difference]: With dead ends: 225 [2025-01-09 22:18:57,755 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 22:18:57,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:57,755 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:57,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 239 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 22:18:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2025-01-09 22:18:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 153 states have (on average 1.869281045751634) internal successors, (286), 217 states have internal predecessors, (286), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:18:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2025-01-09 22:18:57,768 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 7 [2025-01-09 22:18:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:57,768 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2025-01-09 22:18:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2025-01-09 22:18:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:18:57,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:18:57,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1281229926, now seen corresponding path program 1 times [2025-01-09 22:18:57,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590335616] [2025-01-09 22:18:57,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:18:57,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:18:57,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590335616] [2025-01-09 22:18:57,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590335616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:18:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610695353] [2025-01-09 22:18:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:18:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:18:57,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:57,841 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:57,928 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2025-01-09 22:18:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:18:57,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:18:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:57,930 INFO L225 Difference]: With dead ends: 224 [2025-01-09 22:18:57,930 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 22:18:57,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:57,930 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:57,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 239 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 22:18:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2025-01-09 22:18:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 151 states have (on average 1.8609271523178808) internal successors, (281), 214 states have internal predecessors, (281), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:18:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2025-01-09 22:18:57,959 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 7 [2025-01-09 22:18:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:57,960 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2025-01-09 22:18:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2025-01-09 22:18:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:18:57,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:57,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:57,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:18:57,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:57,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 255682226, now seen corresponding path program 1 times [2025-01-09 22:18:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:57,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058603345] [2025-01-09 22:18:57,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:57,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:18:57,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:18:57,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:57,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058603345] [2025-01-09 22:18:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058603345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:57,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:57,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:18:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784454527] [2025-01-09 22:18:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:57,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:18:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:57,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:18:57,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:18:57,982 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,067 INFO L93 Difference]: Finished difference Result 302 states and 379 transitions. [2025-01-09 22:18:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:18:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-01-09 22:18:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,069 INFO L225 Difference]: With dead ends: 302 [2025-01-09 22:18:58,069 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 22:18:58,069 INFO L434 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 [2025-01-09 22:18:58,069 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 74 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 259 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 22:18:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 243. [2025-01-09 22:18:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 172 states have (on average 1.813953488372093) internal successors, (312), 235 states have internal predecessors, (312), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:18:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 322 transitions. [2025-01-09 22:18:58,076 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 322 transitions. Word has length 10 [2025-01-09 22:18:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 322 transitions. [2025-01-09 22:18:58,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 322 transitions. [2025-01-09 22:18:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:18:58,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:18:58,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:58,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 255681842, now seen corresponding path program 1 times [2025-01-09 22:18:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145711983] [2025-01-09 22:18:58,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:18:58,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:18:58,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145711983] [2025-01-09 22:18:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145711983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:18:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794420191] [2025-01-09 22:18:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:18:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:58,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:18:58,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:58,163 INFO L87 Difference]: Start difference. First operand 243 states and 322 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,291 INFO L93 Difference]: Finished difference Result 393 states and 504 transitions. [2025-01-09 22:18:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-01-09 22:18:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,293 INFO L225 Difference]: With dead ends: 393 [2025-01-09 22:18:58,293 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 22:18:58,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:18:58,293 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 128 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 742 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 22:18:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 289. [2025-01-09 22:18:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 213 states have (on average 1.7887323943661972) internal successors, (381), 278 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:18:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 397 transitions. [2025-01-09 22:18:58,301 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 397 transitions. Word has length 10 [2025-01-09 22:18:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,301 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 397 transitions. [2025-01-09 22:18:58,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 397 transitions. [2025-01-09 22:18:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:18:58,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:18:58,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash 253834800, now seen corresponding path program 1 times [2025-01-09 22:18:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164854250] [2025-01-09 22:18:58,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:18:58,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:18:58,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164854250] [2025-01-09 22:18:58,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164854250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:58,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:58,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:18:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979119259] [2025-01-09 22:18:58,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:58,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:18:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:58,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:18:58,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:58,416 INFO L87 Difference]: Start difference. First operand 289 states and 397 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,549 INFO L93 Difference]: Finished difference Result 380 states and 489 transitions. [2025-01-09 22:18:58,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:58,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-01-09 22:18:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,550 INFO L225 Difference]: With dead ends: 380 [2025-01-09 22:18:58,551 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 22:18:58,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:18:58,551 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 117 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 707 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 22:18:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 284. [2025-01-09 22:18:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.8028846153846154) internal successors, (375), 273 states have internal predecessors, (375), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:18:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 391 transitions. [2025-01-09 22:18:58,558 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 391 transitions. Word has length 10 [2025-01-09 22:18:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,558 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 391 transitions. [2025-01-09 22:18:58,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:18:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 391 transitions. [2025-01-09 22:18:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:18:58,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:18:58,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2052292333, now seen corresponding path program 1 times [2025-01-09 22:18:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729718320] [2025-01-09 22:18:58,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:18:58,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:18:58,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729718320] [2025-01-09 22:18:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729718320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:18:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051909730] [2025-01-09 22:18:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:18:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:58,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:18:58,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:58,606 INFO L87 Difference]: Start difference. First operand 284 states and 391 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,749 INFO L93 Difference]: Finished difference Result 379 states and 465 transitions. [2025-01-09 22:18:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:18:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:18:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,752 INFO L225 Difference]: With dead ends: 379 [2025-01-09 22:18:58,752 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 22:18:58,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:18:58,753 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 163 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 331 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 22:18:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 290. [2025-01-09 22:18:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 214 states have (on average 1.780373831775701) internal successors, (381), 279 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:18:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2025-01-09 22:18:58,759 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 15 [2025-01-09 22:18:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,759 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2025-01-09 22:18:58,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2025-01-09 22:18:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:18:58,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:18:58,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2052292334, now seen corresponding path program 1 times [2025-01-09 22:18:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496036792] [2025-01-09 22:18:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:18:58,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:18:58,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:58,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496036792] [2025-01-09 22:18:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496036792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:58,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:58,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:18:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825158744] [2025-01-09 22:18:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:18:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:18:58,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:18:58,829 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:58,919 INFO L93 Difference]: Finished difference Result 291 states and 389 transitions. [2025-01-09 22:18:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:18:58,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:18:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:58,921 INFO L225 Difference]: With dead ends: 291 [2025-01-09 22:18:58,921 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 22:18:58,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:18:58,921 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 174 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:58,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 226 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 22:18:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2025-01-09 22:18:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.7242990654205608) internal successors, (369), 276 states have internal predecessors, (369), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:18:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 385 transitions. [2025-01-09 22:18:58,927 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 385 transitions. Word has length 15 [2025-01-09 22:18:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:58,927 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 385 transitions. [2025-01-09 22:18:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 385 transitions. [2025-01-09 22:18:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:18:58,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:58,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:18:58,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1331298887, now seen corresponding path program 1 times [2025-01-09 22:18:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158975356] [2025-01-09 22:18:58,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:58,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:18:58,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:18:58,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:59,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:59,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158975356] [2025-01-09 22:18:59,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158975356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:59,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:59,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:18:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980366347] [2025-01-09 22:18:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:59,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:18:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:59,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:18:59,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:18:59,032 INFO L87 Difference]: Start difference. First operand 287 states and 385 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:59,212 INFO L93 Difference]: Finished difference Result 392 states and 486 transitions. [2025-01-09 22:18:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 22:18:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:59,214 INFO L225 Difference]: With dead ends: 392 [2025-01-09 22:18:59,214 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 22:18:59,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:18:59,215 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 329 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:59,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 310 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:18:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 22:18:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 284. [2025-01-09 22:18:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 215 states have (on average 1.6883720930232557) internal successors, (363), 273 states have internal predecessors, (363), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:18:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 379 transitions. [2025-01-09 22:18:59,222 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 379 transitions. Word has length 17 [2025-01-09 22:18:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:59,222 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 379 transitions. [2025-01-09 22:18:59,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 379 transitions. [2025-01-09 22:18:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:18:59,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:59,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:59,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:18:59,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:59,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1331298886, now seen corresponding path program 1 times [2025-01-09 22:18:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520997628] [2025-01-09 22:18:59,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:59,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:18:59,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:18:59,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:59,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520997628] [2025-01-09 22:18:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520997628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:18:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243159225] [2025-01-09 22:18:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:18:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:59,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:18:59,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:59,357 INFO L87 Difference]: Start difference. First operand 284 states and 379 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:59,512 INFO L93 Difference]: Finished difference Result 356 states and 480 transitions. [2025-01-09 22:18:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:59,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 22:18:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:59,514 INFO L225 Difference]: With dead ends: 356 [2025-01-09 22:18:59,514 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 22:18:59,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:18:59,514 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 245 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:59,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 460 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:59,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 22:18:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 346. [2025-01-09 22:18:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.6703296703296704) internal successors, (456), 333 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:18:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 480 transitions. [2025-01-09 22:18:59,522 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 480 transitions. Word has length 17 [2025-01-09 22:18:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:59,523 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 480 transitions. [2025-01-09 22:18:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 480 transitions. [2025-01-09 22:18:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:18:59,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:59,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:59,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:18:59,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:59,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1156213947, now seen corresponding path program 1 times [2025-01-09 22:18:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974824561] [2025-01-09 22:18:59,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:59,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:18:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:18:59,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974824561] [2025-01-09 22:18:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974824561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:59,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:18:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638186310] [2025-01-09 22:18:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:59,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:18:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:59,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:18:59,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:59,579 INFO L87 Difference]: Start difference. First operand 346 states and 480 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:59,602 INFO L93 Difference]: Finished difference Result 346 states and 478 transitions. [2025-01-09 22:18:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:59,602 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 22:18:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:59,604 INFO L225 Difference]: With dead ends: 346 [2025-01-09 22:18:59,604 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 22:18:59,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:18:59,604 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:59,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 856 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:18:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 22:18:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-01-09 22:18:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.663003663003663) internal successors, (454), 333 states have internal predecessors, (454), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:18:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2025-01-09 22:18:59,612 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 17 [2025-01-09 22:18:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:59,612 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2025-01-09 22:18:59,612 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2025-01-09 22:18:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:18:59,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:59,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:59,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:18:59,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1482949595, now seen corresponding path program 1 times [2025-01-09 22:18:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:59,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128228785] [2025-01-09 22:18:59,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:59,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:18:59,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:18:59,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:59,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:18:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:18:59,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:18:59,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128228785] [2025-01-09 22:18:59,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128228785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:18:59,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:18:59,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:18:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089060682] [2025-01-09 22:18:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:18:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:18:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:18:59,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:18:59,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:18:59,748 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:18:59,919 INFO L93 Difference]: Finished difference Result 397 states and 549 transitions. [2025-01-09 22:18:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:18:59,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-09 22:18:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:18:59,920 INFO L225 Difference]: With dead ends: 397 [2025-01-09 22:18:59,920 INFO L226 Difference]: Without dead ends: 397 [2025-01-09 22:18:59,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:18:59,921 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 199 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:18:59,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 548 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:18:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-09 22:18:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 341. [2025-01-09 22:18:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 268 states have (on average 1.664179104477612) internal successors, (446), 328 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:18:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 470 transitions. [2025-01-09 22:18:59,929 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 470 transitions. Word has length 18 [2025-01-09 22:18:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:18:59,929 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 470 transitions. [2025-01-09 22:18:59,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:18:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 470 transitions. [2025-01-09 22:18:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:18:59,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:18:59,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:18:59,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:18:59,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:18:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:18:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -845528256, now seen corresponding path program 1 times [2025-01-09 22:18:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:18:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550300551] [2025-01-09 22:18:59,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:18:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:18:59,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:18:59,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:18:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:18:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:00,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550300551] [2025-01-09 22:19:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550300551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:00,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121566206] [2025-01-09 22:19:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:00,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:19:00,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:00,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:19:00,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:19:00,098 INFO L87 Difference]: Start difference. First operand 341 states and 470 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:00,280 INFO L93 Difference]: Finished difference Result 482 states and 637 transitions. [2025-01-09 22:19:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:19:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 22:19:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:00,282 INFO L225 Difference]: With dead ends: 482 [2025-01-09 22:19:00,282 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 22:19:00,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:00,283 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 145 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:00,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1016 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 22:19:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 359. [2025-01-09 22:19:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 286 states have (on average 1.6398601398601398) internal successors, (469), 344 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:19:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 493 transitions. [2025-01-09 22:19:00,290 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 493 transitions. Word has length 21 [2025-01-09 22:19:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:00,291 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 493 transitions. [2025-01-09 22:19:00,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 493 transitions. [2025-01-09 22:19:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:19:00,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:00,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:00,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:19:00,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:00,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1812248817, now seen corresponding path program 1 times [2025-01-09 22:19:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884230542] [2025-01-09 22:19:00,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:00,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:19:00,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:19:00,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:00,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:00,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:00,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884230542] [2025-01-09 22:19:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884230542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882321314] [2025-01-09 22:19:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:19:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:00,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:19:00,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:19:00,439 INFO L87 Difference]: Start difference. First operand 359 states and 493 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:00,687 INFO L93 Difference]: Finished difference Result 458 states and 604 transitions. [2025-01-09 22:19:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:19:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 22:19:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:00,690 INFO L225 Difference]: With dead ends: 458 [2025-01-09 22:19:00,690 INFO L226 Difference]: Without dead ends: 458 [2025-01-09 22:19:00,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:19:00,692 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 108 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:00,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 995 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-09 22:19:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 353. [2025-01-09 22:19:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 280 states have (on average 1.6357142857142857) internal successors, (458), 338 states have internal predecessors, (458), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:19:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 482 transitions. [2025-01-09 22:19:00,700 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 482 transitions. Word has length 21 [2025-01-09 22:19:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:00,701 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 482 transitions. [2025-01-09 22:19:00,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 482 transitions. [2025-01-09 22:19:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:19:00,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:00,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:00,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:19:00,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:00,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1128902431, now seen corresponding path program 1 times [2025-01-09 22:19:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724545874] [2025-01-09 22:19:00,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:00,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:19:00,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:19:00,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:00,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:00,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724545874] [2025-01-09 22:19:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724545874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:00,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:00,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58583365] [2025-01-09 22:19:00,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:19:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:00,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:19:00,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:19:00,869 INFO L87 Difference]: Start difference. First operand 353 states and 482 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,107 INFO L93 Difference]: Finished difference Result 474 states and 620 transitions. [2025-01-09 22:19:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:19:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 22:19:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,109 INFO L225 Difference]: With dead ends: 474 [2025-01-09 22:19:01,110 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 22:19:01,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:19:01,111 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 116 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1112 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 22:19:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 361. [2025-01-09 22:19:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 288 states have (on average 1.6180555555555556) internal successors, (466), 344 states have internal predecessors, (466), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:19:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 490 transitions. [2025-01-09 22:19:01,119 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 490 transitions. Word has length 22 [2025-01-09 22:19:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,120 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 490 transitions. [2025-01-09 22:19:01,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 490 transitions. [2025-01-09 22:19:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:19:01,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:01,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:19:01,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2116999516, now seen corresponding path program 1 times [2025-01-09 22:19:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045500770] [2025-01-09 22:19:01,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:19:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:19:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:01,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045500770] [2025-01-09 22:19:01,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045500770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:19:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015237256] [2025-01-09 22:19:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:01,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:19:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:01,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:19:01,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:01,172 INFO L87 Difference]: Start difference. First operand 361 states and 490 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,281 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2025-01-09 22:19:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:19:01,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:19:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,286 INFO L225 Difference]: With dead ends: 361 [2025-01-09 22:19:01,286 INFO L226 Difference]: Without dead ends: 361 [2025-01-09 22:19:01,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:01,287 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 28 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 458 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-09 22:19:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2025-01-09 22:19:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 289 states have (on average 1.5847750865051904) internal successors, (458), 339 states have internal predecessors, (458), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 22:19:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 482 transitions. [2025-01-09 22:19:01,295 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 482 transitions. Word has length 23 [2025-01-09 22:19:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,295 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 482 transitions. [2025-01-09 22:19:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 482 transitions. [2025-01-09 22:19:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:19:01,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:01,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:19:01,296 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:01,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2116999517, now seen corresponding path program 1 times [2025-01-09 22:19:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694027038] [2025-01-09 22:19:01,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:19:01,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:19:01,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:01,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694027038] [2025-01-09 22:19:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694027038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:01,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:01,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402083164] [2025-01-09 22:19:01,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:01,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:19:01,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:01,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:19:01,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:19:01,438 INFO L87 Difference]: Start difference. First operand 356 states and 482 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,606 INFO L93 Difference]: Finished difference Result 333 states and 442 transitions. [2025-01-09 22:19:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:19:01,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:19:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,607 INFO L225 Difference]: With dead ends: 333 [2025-01-09 22:19:01,607 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 22:19:01,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:19:01,608 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1007 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 22:19:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 303. [2025-01-09 22:19:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 240 states have (on average 1.6125) internal successors, (387), 290 states have internal predecessors, (387), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 405 transitions. [2025-01-09 22:19:01,615 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 405 transitions. Word has length 23 [2025-01-09 22:19:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,615 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 405 transitions. [2025-01-09 22:19:01,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 405 transitions. [2025-01-09 22:19:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:19:01,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:01,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:19:01,616 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:01,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 302359058, now seen corresponding path program 1 times [2025-01-09 22:19:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614876645] [2025-01-09 22:19:01,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:19:01,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:19:01,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614876645] [2025-01-09 22:19:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614876645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:19:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60317630] [2025-01-09 22:19:01,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:01,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:19:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:19:01,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:01,648 INFO L87 Difference]: Start difference. First operand 303 states and 405 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,665 INFO L93 Difference]: Finished difference Result 315 states and 417 transitions. [2025-01-09 22:19:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:19:01,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 22:19:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,666 INFO L225 Difference]: With dead ends: 315 [2025-01-09 22:19:01,667 INFO L226 Difference]: Without dead ends: 315 [2025-01-09 22:19:01,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:01,667 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:19:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-09 22:19:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-01-09 22:19:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 252 states have (on average 1.5833333333333333) internal successors, (399), 302 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 417 transitions. [2025-01-09 22:19:01,673 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 417 transitions. Word has length 25 [2025-01-09 22:19:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,673 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 417 transitions. [2025-01-09 22:19:01,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 417 transitions. [2025-01-09 22:19:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:19:01,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:01,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:19:01,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 304206100, now seen corresponding path program 1 times [2025-01-09 22:19:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465904428] [2025-01-09 22:19:01,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:19:01,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:19:01,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465904428] [2025-01-09 22:19:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465904428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:19:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581325400] [2025-01-09 22:19:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:19:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:01,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:19:01,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:19:01,700 INFO L87 Difference]: Start difference. First operand 315 states and 417 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,778 INFO L93 Difference]: Finished difference Result 313 states and 409 transitions. [2025-01-09 22:19:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:19:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 22:19:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,779 INFO L225 Difference]: With dead ends: 313 [2025-01-09 22:19:01,779 INFO L226 Difference]: Without dead ends: 313 [2025-01-09 22:19:01,779 INFO L434 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 [2025-01-09 22:19:01,780 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 219 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-01-09 22:19:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-01-09 22:19:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.5515873015873016) internal successors, (391), 300 states have internal predecessors, (391), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 409 transitions. [2025-01-09 22:19:01,788 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 409 transitions. Word has length 25 [2025-01-09 22:19:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,788 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 409 transitions. [2025-01-09 22:19:01,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 409 transitions. [2025-01-09 22:19:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:19:01,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:01,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:19:01,788 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:01,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash 304206101, now seen corresponding path program 1 times [2025-01-09 22:19:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075649030] [2025-01-09 22:19:01,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:19:01,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:19:01,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075649030] [2025-01-09 22:19:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075649030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:19:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852845346] [2025-01-09 22:19:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:01,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:19:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:01,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:19:01,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:01,846 INFO L87 Difference]: Start difference. First operand 313 states and 409 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:01,924 INFO L93 Difference]: Finished difference Result 391 states and 512 transitions. [2025-01-09 22:19:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:19:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 22:19:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:01,926 INFO L225 Difference]: With dead ends: 391 [2025-01-09 22:19:01,926 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 22:19:01,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:01,927 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:01,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 245 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 22:19:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2025-01-09 22:19:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 324 states have (on average 1.5246913580246915) internal successors, (494), 372 states have internal predecessors, (494), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 512 transitions. [2025-01-09 22:19:01,932 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 512 transitions. Word has length 25 [2025-01-09 22:19:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:01,933 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 512 transitions. [2025-01-09 22:19:01,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 512 transitions. [2025-01-09 22:19:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:19:01,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:01,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:19:01,933 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 247088151, now seen corresponding path program 1 times [2025-01-09 22:19:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464674233] [2025-01-09 22:19:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:19:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:19:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464674233] [2025-01-09 22:19:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464674233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:19:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264725039] [2025-01-09 22:19:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:19:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:01,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:19:01,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:19:01,984 INFO L87 Difference]: Start difference. First operand 385 states and 512 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:02,005 INFO L93 Difference]: Finished difference Result 434 states and 575 transitions. [2025-01-09 22:19:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:19:02,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:19:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:02,009 INFO L225 Difference]: With dead ends: 434 [2025-01-09 22:19:02,009 INFO L226 Difference]: Without dead ends: 434 [2025-01-09 22:19:02,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:19:02,010 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 44 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:02,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 790 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:19:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-09 22:19:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 385. [2025-01-09 22:19:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 324 states have (on average 1.5154320987654322) internal successors, (491), 372 states have internal predecessors, (491), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2025-01-09 22:19:02,018 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 26 [2025-01-09 22:19:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2025-01-09 22:19:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2025-01-09 22:19:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:19:02,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:02,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:02,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:19:02,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:02,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash -749984202, now seen corresponding path program 1 times [2025-01-09 22:19:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486277741] [2025-01-09 22:19:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:02,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:19:02,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:19:02,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:02,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486277741] [2025-01-09 22:19:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486277741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:02,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:19:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36265991] [2025-01-09 22:19:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:02,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:19:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:02,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:19:02,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:02,076 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:02,152 INFO L93 Difference]: Finished difference Result 463 states and 612 transitions. [2025-01-09 22:19:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:19:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:19:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:02,153 INFO L225 Difference]: With dead ends: 463 [2025-01-09 22:19:02,153 INFO L226 Difference]: Without dead ends: 463 [2025-01-09 22:19:02,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:02,154 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:02,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 259 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-09 22:19:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 385. [2025-01-09 22:19:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 324 states have (on average 1.5154320987654322) internal successors, (491), 372 states have internal predecessors, (491), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2025-01-09 22:19:02,162 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 26 [2025-01-09 22:19:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:02,162 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2025-01-09 22:19:02,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2025-01-09 22:19:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:19:02,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:02,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:19:02,163 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash -48919624, now seen corresponding path program 1 times [2025-01-09 22:19:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:02,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122764427] [2025-01-09 22:19:02,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:02,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:19:02,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:19:02,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122764427] [2025-01-09 22:19:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122764427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:19:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684131483] [2025-01-09 22:19:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:02,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:19:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:02,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:19:02,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:19:02,215 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:02,235 INFO L93 Difference]: Finished difference Result 312 states and 399 transitions. [2025-01-09 22:19:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:19:02,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:19:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:02,236 INFO L225 Difference]: With dead ends: 312 [2025-01-09 22:19:02,236 INFO L226 Difference]: Without dead ends: 312 [2025-01-09 22:19:02,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:19:02,237 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:02,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 800 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:19:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-09 22:19:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-01-09 22:19:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 252 states have (on average 1.5119047619047619) internal successors, (381), 299 states have internal predecessors, (381), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 399 transitions. [2025-01-09 22:19:02,243 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 399 transitions. Word has length 26 [2025-01-09 22:19:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:02,244 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 399 transitions. [2025-01-09 22:19:02,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2025-01-09 22:19:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:19:02,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:02,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:02,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:19:02,245 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:02,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 284288149, now seen corresponding path program 1 times [2025-01-09 22:19:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499667612] [2025-01-09 22:19:02,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:19:02,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:19:02,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:02,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499667612] [2025-01-09 22:19:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499667612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:19:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604932709] [2025-01-09 22:19:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:19:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:19:02,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:19:02,328 INFO L87 Difference]: Start difference. First operand 312 states and 399 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:02,460 INFO L93 Difference]: Finished difference Result 350 states and 445 transitions. [2025-01-09 22:19:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:19:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-09 22:19:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:02,462 INFO L225 Difference]: With dead ends: 350 [2025-01-09 22:19:02,462 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 22:19:02,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:19:02,462 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 14 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:02,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 676 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 22:19:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 344. [2025-01-09 22:19:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 284 states have (on average 1.4753521126760563) internal successors, (419), 331 states have internal predecessors, (419), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 437 transitions. [2025-01-09 22:19:02,467 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 437 transitions. Word has length 27 [2025-01-09 22:19:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:02,467 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 437 transitions. [2025-01-09 22:19:02,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 437 transitions. [2025-01-09 22:19:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:19:02,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:02,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:19:02,467 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:02,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 284288343, now seen corresponding path program 1 times [2025-01-09 22:19:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459018098] [2025-01-09 22:19:02,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:19:02,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:19:02,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:02,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459018098] [2025-01-09 22:19:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459018098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:19:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74822494] [2025-01-09 22:19:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:19:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:02,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:19:02,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:02,530 INFO L87 Difference]: Start difference. First operand 344 states and 437 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:02,682 INFO L93 Difference]: Finished difference Result 491 states and 634 transitions. [2025-01-09 22:19:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:19:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-09 22:19:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:02,684 INFO L225 Difference]: With dead ends: 491 [2025-01-09 22:19:02,684 INFO L226 Difference]: Without dead ends: 491 [2025-01-09 22:19:02,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:02,684 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 71 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:02,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 505 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-09 22:19:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 456. [2025-01-09 22:19:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 396 states have (on average 1.4545454545454546) internal successors, (576), 443 states have internal predecessors, (576), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 594 transitions. [2025-01-09 22:19:02,690 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 594 transitions. Word has length 27 [2025-01-09 22:19:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:02,690 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 594 transitions. [2025-01-09 22:19:02,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 594 transitions. [2025-01-09 22:19:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:19:02,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:02,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:19:02,691 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:02,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash 819689016, now seen corresponding path program 1 times [2025-01-09 22:19:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737717478] [2025-01-09 22:19:02,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:19:02,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:19:02,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:02,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:02,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737717478] [2025-01-09 22:19:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737717478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:19:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734696102] [2025-01-09 22:19:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:02,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:19:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:02,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:19:02,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:02,766 INFO L87 Difference]: Start difference. First operand 456 states and 594 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:02,949 INFO L93 Difference]: Finished difference Result 491 states and 626 transitions. [2025-01-09 22:19:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:19:02,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-09 22:19:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:02,951 INFO L225 Difference]: With dead ends: 491 [2025-01-09 22:19:02,951 INFO L226 Difference]: Without dead ends: 491 [2025-01-09 22:19:02,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:02,952 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:02,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 349 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-09 22:19:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 343. [2025-01-09 22:19:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 284 states have (on average 1.4471830985915493) internal successors, (411), 330 states have internal predecessors, (411), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 429 transitions. [2025-01-09 22:19:02,958 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 429 transitions. Word has length 28 [2025-01-09 22:19:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:02,959 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 429 transitions. [2025-01-09 22:19:02,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 429 transitions. [2025-01-09 22:19:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:19:02,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:02,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:19:02,959 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 474791138, now seen corresponding path program 1 times [2025-01-09 22:19:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:02,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000126512] [2025-01-09 22:19:02,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:02,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:19:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:19:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000126512] [2025-01-09 22:19:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000126512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:03,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:19:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501777056] [2025-01-09 22:19:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:03,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:19:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:03,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:19:03,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:03,017 INFO L87 Difference]: Start difference. First operand 343 states and 429 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:03,187 INFO L93 Difference]: Finished difference Result 344 states and 429 transitions. [2025-01-09 22:19:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:19:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-01-09 22:19:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:03,189 INFO L225 Difference]: With dead ends: 344 [2025-01-09 22:19:03,189 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 22:19:03,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:03,189 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 52 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:03,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 405 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 22:19:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2025-01-09 22:19:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 284 states have (on average 1.4401408450704225) internal successors, (409), 329 states have internal predecessors, (409), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 427 transitions. [2025-01-09 22:19:03,195 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 427 transitions. Word has length 33 [2025-01-09 22:19:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:03,195 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 427 transitions. [2025-01-09 22:19:03,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 427 transitions. [2025-01-09 22:19:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:19:03,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:03,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:19:03,196 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:03,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 474791139, now seen corresponding path program 1 times [2025-01-09 22:19:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:03,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669435947] [2025-01-09 22:19:03,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:03,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:19:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:19:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:03,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669435947] [2025-01-09 22:19:03,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669435947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:03,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:03,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:19:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788809737] [2025-01-09 22:19:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:19:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:03,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:19:03,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:03,301 INFO L87 Difference]: Start difference. First operand 342 states and 427 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:03,456 INFO L93 Difference]: Finished difference Result 343 states and 427 transitions. [2025-01-09 22:19:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:19:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-01-09 22:19:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:03,458 INFO L225 Difference]: With dead ends: 343 [2025-01-09 22:19:03,458 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 22:19:03,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:03,458 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 40 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:03,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 417 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 22:19:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-01-09 22:19:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 284 states have (on average 1.4330985915492958) internal successors, (407), 328 states have internal predecessors, (407), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 425 transitions. [2025-01-09 22:19:03,464 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 425 transitions. Word has length 33 [2025-01-09 22:19:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:03,464 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 425 transitions. [2025-01-09 22:19:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 425 transitions. [2025-01-09 22:19:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:19:03,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:03,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:03,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:19:03,464 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1007753443, now seen corresponding path program 1 times [2025-01-09 22:19:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972528668] [2025-01-09 22:19:03,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:03,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:19:03,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:19:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972528668] [2025-01-09 22:19:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972528668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:03,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:19:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982209187] [2025-01-09 22:19:03,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:19:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:03,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:19:03,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:03,522 INFO L87 Difference]: Start difference. First operand 341 states and 425 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:03,652 INFO L93 Difference]: Finished difference Result 347 states and 421 transitions. [2025-01-09 22:19:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:19:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 22:19:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:03,654 INFO L225 Difference]: With dead ends: 347 [2025-01-09 22:19:03,654 INFO L226 Difference]: Without dead ends: 347 [2025-01-09 22:19:03,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:03,655 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:03,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 419 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-09 22:19:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 338. [2025-01-09 22:19:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 284 states have (on average 1.4119718309859155) internal successors, (401), 325 states have internal predecessors, (401), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 419 transitions. [2025-01-09 22:19:03,660 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 419 transitions. Word has length 35 [2025-01-09 22:19:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:03,660 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 419 transitions. [2025-01-09 22:19:03,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 419 transitions. [2025-01-09 22:19:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:19:03,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:03,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 22:19:03,661 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:03,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1007753444, now seen corresponding path program 1 times [2025-01-09 22:19:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476797013] [2025-01-09 22:19:03,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:03,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:19:03,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:19:03,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:03,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476797013] [2025-01-09 22:19:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476797013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:03,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:03,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:19:03,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935861686] [2025-01-09 22:19:03,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:03,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:19:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:03,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:19:03,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:19:03,755 INFO L87 Difference]: Start difference. First operand 338 states and 419 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:03,874 INFO L93 Difference]: Finished difference Result 346 states and 419 transitions. [2025-01-09 22:19:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:19:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 22:19:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:03,876 INFO L225 Difference]: With dead ends: 346 [2025-01-09 22:19:03,876 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 22:19:03,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:19:03,876 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 275 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:03,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 403 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 22:19:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 337. [2025-01-09 22:19:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 284 states have (on average 1.4049295774647887) internal successors, (399), 324 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 417 transitions. [2025-01-09 22:19:03,881 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 417 transitions. Word has length 35 [2025-01-09 22:19:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 417 transitions. [2025-01-09 22:19:03,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 417 transitions. [2025-01-09 22:19:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:19:03,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:03,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:03,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:19:03,882 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1007753605, now seen corresponding path program 1 times [2025-01-09 22:19:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996522056] [2025-01-09 22:19:03,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:03,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:19:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:19:03,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:03,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:04,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996522056] [2025-01-09 22:19:04,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996522056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:04,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:04,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:19:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997489820] [2025-01-09 22:19:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:19:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:04,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:19:04,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:19:04,004 INFO L87 Difference]: Start difference. First operand 337 states and 417 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:04,069 INFO L93 Difference]: Finished difference Result 337 states and 415 transitions. [2025-01-09 22:19:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:19:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 22:19:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:04,070 INFO L225 Difference]: With dead ends: 337 [2025-01-09 22:19:04,070 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 22:19:04,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:19:04,070 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 177 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:04,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 173 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 22:19:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2025-01-09 22:19:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 284 states have (on average 1.3908450704225352) internal successors, (395), 322 states have internal predecessors, (395), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2025-01-09 22:19:04,077 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 35 [2025-01-09 22:19:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:04,077 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2025-01-09 22:19:04,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2025-01-09 22:19:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:19:04,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:04,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:04,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:19:04,078 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:04,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1440975970, now seen corresponding path program 1 times [2025-01-09 22:19:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11446895] [2025-01-09 22:19:04,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:04,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:19:04,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:19:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11446895] [2025-01-09 22:19:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11446895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:19:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918532076] [2025-01-09 22:19:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:04,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:19:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:04,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:19:04,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:04,575 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:04,946 INFO L93 Difference]: Finished difference Result 366 states and 445 transitions. [2025-01-09 22:19:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:19:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-09 22:19:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:04,947 INFO L225 Difference]: With dead ends: 366 [2025-01-09 22:19:04,947 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 22:19:04,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:19:04,948 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 93 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:04,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 871 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 22:19:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 357. [2025-01-09 22:19:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 306 states have (on average 1.3660130718954249) internal successors, (418), 344 states have internal predecessors, (418), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:19:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 436 transitions. [2025-01-09 22:19:04,953 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 436 transitions. Word has length 49 [2025-01-09 22:19:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 436 transitions. [2025-01-09 22:19:04,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 436 transitions. [2025-01-09 22:19:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:19:04,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:04,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:04,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:19:04,954 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:04,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash -209726198, now seen corresponding path program 1 times [2025-01-09 22:19:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:04,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815963200] [2025-01-09 22:19:04,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:04,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:19:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:19:04,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:04,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:05,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815963200] [2025-01-09 22:19:05,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815963200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:05,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:19:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038539245] [2025-01-09 22:19:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:19:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:05,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:19:05,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:19:05,111 INFO L87 Difference]: Start difference. First operand 357 states and 436 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:05,335 INFO L93 Difference]: Finished difference Result 587 states and 718 transitions. [2025-01-09 22:19:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:19:05,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-09 22:19:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:05,337 INFO L225 Difference]: With dead ends: 587 [2025-01-09 22:19:05,337 INFO L226 Difference]: Without dead ends: 587 [2025-01-09 22:19:05,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:05,338 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 171 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:05,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1048 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-09 22:19:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2025-01-09 22:19:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 374 states have (on average 1.3796791443850267) internal successors, (516), 416 states have internal predecessors, (516), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-09 22:19:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 546 transitions. [2025-01-09 22:19:05,344 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 546 transitions. Word has length 50 [2025-01-09 22:19:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:05,345 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 546 transitions. [2025-01-09 22:19:05,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 546 transitions. [2025-01-09 22:19:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:19:05,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:05,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:05,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:19:05,345 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:05,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash -209726582, now seen corresponding path program 1 times [2025-01-09 22:19:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454858140] [2025-01-09 22:19:05,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:05,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:19:05,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:19:05,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:05,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:05,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454858140] [2025-01-09 22:19:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454858140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:19:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301276264] [2025-01-09 22:19:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:05,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:19:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:05,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:19:05,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:19:05,506 INFO L87 Difference]: Start difference. First operand 433 states and 546 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:05,763 INFO L93 Difference]: Finished difference Result 616 states and 766 transitions. [2025-01-09 22:19:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:19:05,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-09 22:19:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:05,765 INFO L225 Difference]: With dead ends: 616 [2025-01-09 22:19:05,765 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 22:19:05,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:19:05,766 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 169 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:05,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 810 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 22:19:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 462. [2025-01-09 22:19:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 400 states have (on average 1.3775) internal successors, (551), 443 states have internal predecessors, (551), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 22:19:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 587 transitions. [2025-01-09 22:19:05,772 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 587 transitions. Word has length 50 [2025-01-09 22:19:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:05,772 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 587 transitions. [2025-01-09 22:19:05,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 587 transitions. [2025-01-09 22:19:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:19:05,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:05,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:19:05,773 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -209726581, now seen corresponding path program 1 times [2025-01-09 22:19:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878899464] [2025-01-09 22:19:05,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:05,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:19:05,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:19:05,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:05,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:06,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:06,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878899464] [2025-01-09 22:19:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878899464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:06,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291658384] [2025-01-09 22:19:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:06,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:19:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:06,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:19:06,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:19:06,070 INFO L87 Difference]: Start difference. First operand 462 states and 587 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:06,358 INFO L93 Difference]: Finished difference Result 612 states and 751 transitions. [2025-01-09 22:19:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:19:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-09 22:19:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:06,360 INFO L225 Difference]: With dead ends: 612 [2025-01-09 22:19:06,361 INFO L226 Difference]: Without dead ends: 612 [2025-01-09 22:19:06,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:06,361 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 158 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:06,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 891 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-09 22:19:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 465. [2025-01-09 22:19:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 403 states have (on average 1.3746898263027296) internal successors, (554), 446 states have internal predecessors, (554), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 22:19:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 590 transitions. [2025-01-09 22:19:06,369 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 590 transitions. Word has length 50 [2025-01-09 22:19:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:06,369 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 590 transitions. [2025-01-09 22:19:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 590 transitions. [2025-01-09 22:19:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:19:06,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:06,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:06,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 22:19:06,370 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash -211573240, now seen corresponding path program 1 times [2025-01-09 22:19:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611521707] [2025-01-09 22:19:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:19:06,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:19:06,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:06,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:06,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611521707] [2025-01-09 22:19:06,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611521707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:06,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 22:19:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225057027] [2025-01-09 22:19:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:19:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:06,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:19:06,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:19:06,854 INFO L87 Difference]: Start difference. First operand 465 states and 590 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:07,334 INFO L93 Difference]: Finished difference Result 589 states and 711 transitions. [2025-01-09 22:19:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:19:07,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-09 22:19:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:07,336 INFO L225 Difference]: With dead ends: 589 [2025-01-09 22:19:07,336 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 22:19:07,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:19:07,337 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 270 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:07,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 961 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:19:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 22:19:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 495. [2025-01-09 22:19:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 433 states have (on average 1.3602771362586605) internal successors, (589), 476 states have internal predecessors, (589), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 22:19:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 625 transitions. [2025-01-09 22:19:07,344 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 625 transitions. Word has length 50 [2025-01-09 22:19:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:07,345 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 625 transitions. [2025-01-09 22:19:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 625 transitions. [2025-01-09 22:19:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:19:07,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:07,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 22:19:07,346 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:07,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash 554808767, now seen corresponding path program 1 times [2025-01-09 22:19:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041467659] [2025-01-09 22:19:07,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:07,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:19:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:19:07,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:07,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041467659] [2025-01-09 22:19:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041467659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:07,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:07,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 22:19:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764706924] [2025-01-09 22:19:07,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:07,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:19:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:07,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:19:07,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:19:07,871 INFO L87 Difference]: Start difference. First operand 495 states and 625 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:08,476 INFO L93 Difference]: Finished difference Result 590 states and 715 transitions. [2025-01-09 22:19:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:19:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-09 22:19:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:08,478 INFO L225 Difference]: With dead ends: 590 [2025-01-09 22:19:08,478 INFO L226 Difference]: Without dead ends: 590 [2025-01-09 22:19:08,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:19:08,480 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 214 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:08,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1397 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:19:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-09 22:19:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 490. [2025-01-09 22:19:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 428 states have (on average 1.3714953271028036) internal successors, (587), 471 states have internal predecessors, (587), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 22:19:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 623 transitions. [2025-01-09 22:19:08,486 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 623 transitions. Word has length 50 [2025-01-09 22:19:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:08,486 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 623 transitions. [2025-01-09 22:19:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 623 transitions. [2025-01-09 22:19:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:08,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:08,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:08,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 22:19:08,487 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 455878436, now seen corresponding path program 1 times [2025-01-09 22:19:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:08,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302776651] [2025-01-09 22:19:08,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:08,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:08,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:08,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:08,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:08,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302776651] [2025-01-09 22:19:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302776651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:08,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 22:19:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533003487] [2025-01-09 22:19:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:08,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:19:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:08,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:19:08,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:19:08,865 INFO L87 Difference]: Start difference. First operand 490 states and 623 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:09,205 INFO L93 Difference]: Finished difference Result 945 states and 1196 transitions. [2025-01-09 22:19:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:19:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:09,207 INFO L225 Difference]: With dead ends: 945 [2025-01-09 22:19:09,207 INFO L226 Difference]: Without dead ends: 945 [2025-01-09 22:19:09,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:19:09,208 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 397 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:09,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1580 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:19:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-01-09 22:19:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 729. [2025-01-09 22:19:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 647 states have (on average 1.3771251931993818) internal successors, (891), 700 states have internal predecessors, (891), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2025-01-09 22:19:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 957 transitions. [2025-01-09 22:19:09,217 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 957 transitions. Word has length 51 [2025-01-09 22:19:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:09,217 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 957 transitions. [2025-01-09 22:19:09,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 957 transitions. [2025-01-09 22:19:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:09,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:09,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:09,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 22:19:09,218 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 455878052, now seen corresponding path program 1 times [2025-01-09 22:19:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167105533] [2025-01-09 22:19:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:09,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:09,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167105533] [2025-01-09 22:19:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167105533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:09,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:09,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 22:19:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880035842] [2025-01-09 22:19:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:19:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:09,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:19:09,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:19:09,614 INFO L87 Difference]: Start difference. First operand 729 states and 957 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:10,041 INFO L93 Difference]: Finished difference Result 982 states and 1259 transitions. [2025-01-09 22:19:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:19:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:10,043 INFO L225 Difference]: With dead ends: 982 [2025-01-09 22:19:10,043 INFO L226 Difference]: Without dead ends: 982 [2025-01-09 22:19:10,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:19:10,044 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 395 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:10,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1407 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:19:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-01-09 22:19:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 759. [2025-01-09 22:19:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 673 states have (on average 1.3774145616641902) internal successors, (927), 728 states have internal predecessors, (927), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2025-01-09 22:19:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 999 transitions. [2025-01-09 22:19:10,053 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 999 transitions. Word has length 51 [2025-01-09 22:19:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:10,053 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 999 transitions. [2025-01-09 22:19:10,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 999 transitions. [2025-01-09 22:19:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:10,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:10,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:10,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 22:19:10,054 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:10,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 455878053, now seen corresponding path program 1 times [2025-01-09 22:19:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893119844] [2025-01-09 22:19:10,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:10,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:10,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:10,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:10,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893119844] [2025-01-09 22:19:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893119844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:19:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846051127] [2025-01-09 22:19:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:19:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:10,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:19:10,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:19:10,437 INFO L87 Difference]: Start difference. First operand 759 states and 999 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:10,873 INFO L93 Difference]: Finished difference Result 1350 states and 1789 transitions. [2025-01-09 22:19:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:19:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:10,877 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 22:19:10,877 INFO L226 Difference]: Without dead ends: 1350 [2025-01-09 22:19:10,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:19:10,877 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 373 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:10,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1057 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:19:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-01-09 22:19:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1141. [2025-01-09 22:19:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1011 states have (on average 1.3956478733926805) internal successors, (1411), 1088 states have internal predecessors, (1411), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-01-09 22:19:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1549 transitions. [2025-01-09 22:19:10,890 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1549 transitions. Word has length 51 [2025-01-09 22:19:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:10,890 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1549 transitions. [2025-01-09 22:19:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1549 transitions. [2025-01-09 22:19:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:10,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:10,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:10,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 22:19:10,891 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1151623425, now seen corresponding path program 1 times [2025-01-09 22:19:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307003393] [2025-01-09 22:19:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:10,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:10,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:10,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:10,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307003393] [2025-01-09 22:19:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307003393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:11,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997055919] [2025-01-09 22:19:11,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:11,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:19:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:11,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:19:11,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:19:11,009 INFO L87 Difference]: Start difference. First operand 1141 states and 1549 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:11,185 INFO L93 Difference]: Finished difference Result 1399 states and 1865 transitions. [2025-01-09 22:19:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:19:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:11,188 INFO L225 Difference]: With dead ends: 1399 [2025-01-09 22:19:11,188 INFO L226 Difference]: Without dead ends: 1399 [2025-01-09 22:19:11,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:11,189 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 142 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:11,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1181 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:19:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-01-09 22:19:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1186. [2025-01-09 22:19:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1052 states have (on average 1.4011406844106464) internal successors, (1474), 1131 states have internal predecessors, (1474), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-01-09 22:19:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1618 transitions. [2025-01-09 22:19:11,201 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1618 transitions. Word has length 51 [2025-01-09 22:19:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:11,201 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1618 transitions. [2025-01-09 22:19:11,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1618 transitions. [2025-01-09 22:19:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:11,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:11,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:11,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 22:19:11,202 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1151623041, now seen corresponding path program 1 times [2025-01-09 22:19:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187528345] [2025-01-09 22:19:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:11,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:11,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:11,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:11,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187528345] [2025-01-09 22:19:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187528345] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665176350] [2025-01-09 22:19:11,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:11,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:11,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:11,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:19:11,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:19:11,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:11,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:11,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:11,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:11,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 22:19:11,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:11,851 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 [2025-01-09 22:19:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:19:12,026 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 22 [2025-01-09 22:19:12,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:19:12,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-01-09 22:19:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:12,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:19:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665176350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:19:12,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2025-01-09 22:19:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30309626] [2025-01-09 22:19:12,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:12,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:19:12,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:12,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:19:12,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:19:12,193 INFO L87 Difference]: Start difference. First operand 1186 states and 1618 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:12,771 INFO L93 Difference]: Finished difference Result 1546 states and 2060 transitions. [2025-01-09 22:19:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:19:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:12,776 INFO L225 Difference]: With dead ends: 1546 [2025-01-09 22:19:12,776 INFO L226 Difference]: Without dead ends: 1546 [2025-01-09 22:19:12,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:19:12,780 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 307 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:12,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 2366 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:19:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-01-09 22:19:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1254. [2025-01-09 22:19:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1112 states have (on average 1.3965827338129497) internal successors, (1553), 1195 states have internal predecessors, (1553), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2025-01-09 22:19:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1709 transitions. [2025-01-09 22:19:12,801 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1709 transitions. Word has length 51 [2025-01-09 22:19:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:12,802 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1709 transitions. [2025-01-09 22:19:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1709 transitions. [2025-01-09 22:19:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:12,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:12,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:12,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:19:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:13,008 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1151623042, now seen corresponding path program 1 times [2025-01-09 22:19:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003492919] [2025-01-09 22:19:13,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:13,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:13,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:13,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:13,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003492919] [2025-01-09 22:19:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003492919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007886155] [2025-01-09 22:19:13,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:13,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:13,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:13,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:19:13,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:19:13,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:13,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:13,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:13,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:13,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-09 22:19:13,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:13,772 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 [2025-01-09 22:19:14,056 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 [2025-01-09 22:19:14,060 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 [2025-01-09 22:19:14,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:19:14,193 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 25 treesize of output 20 [2025-01-09 22:19:14,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-01-09 22:19:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:14,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:19:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007886155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:14,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:19:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 25 [2025-01-09 22:19:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337392907] [2025-01-09 22:19:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:19:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:14,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:19:14,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:19:14,405 INFO L87 Difference]: Start difference. First operand 1254 states and 1709 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:15,035 INFO L93 Difference]: Finished difference Result 1522 states and 2025 transitions. [2025-01-09 22:19:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:19:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:15,040 INFO L225 Difference]: With dead ends: 1522 [2025-01-09 22:19:15,040 INFO L226 Difference]: Without dead ends: 1522 [2025-01-09 22:19:15,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:19:15,041 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 310 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:15,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 2218 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:19:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-01-09 22:19:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1200. [2025-01-09 22:19:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1066 states have (on average 1.399624765478424) internal successors, (1492), 1145 states have internal predecessors, (1492), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-01-09 22:19:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1636 transitions. [2025-01-09 22:19:15,055 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1636 transitions. Word has length 51 [2025-01-09 22:19:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:15,055 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1636 transitions. [2025-01-09 22:19:15,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1636 transitions. [2025-01-09 22:19:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:15,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:15,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:15,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:19:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:15,257 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1149776383, now seen corresponding path program 1 times [2025-01-09 22:19:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:15,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863307798] [2025-01-09 22:19:15,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:15,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:15,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:15,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:15,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:15,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863307798] [2025-01-09 22:19:15,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863307798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:15,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:15,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:19:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294965007] [2025-01-09 22:19:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:15,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:19:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:15,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:19:15,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:19:15,412 INFO L87 Difference]: Start difference. First operand 1200 states and 1636 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:15,636 INFO L93 Difference]: Finished difference Result 1414 states and 1881 transitions. [2025-01-09 22:19:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:19:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:15,640 INFO L225 Difference]: With dead ends: 1414 [2025-01-09 22:19:15,640 INFO L226 Difference]: Without dead ends: 1414 [2025-01-09 22:19:15,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:19:15,640 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 309 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:15,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1258 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-01-09 22:19:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1109. [2025-01-09 22:19:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 983 states have (on average 1.3865717192268565) internal successors, (1363), 1058 states have internal predecessors, (1363), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-01-09 22:19:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1495 transitions. [2025-01-09 22:19:15,660 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1495 transitions. Word has length 51 [2025-01-09 22:19:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:15,660 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1495 transitions. [2025-01-09 22:19:15,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1495 transitions. [2025-01-09 22:19:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:19:15,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:15,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 22:19:15,662 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1149775999, now seen corresponding path program 1 times [2025-01-09 22:19:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298774386] [2025-01-09 22:19:15,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:15,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:19:15,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:19:15,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298774386] [2025-01-09 22:19:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298774386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:19:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335191043] [2025-01-09 22:19:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:19:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:19:16,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:16,053 INFO L87 Difference]: Start difference. First operand 1109 states and 1495 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:16,331 INFO L93 Difference]: Finished difference Result 1355 states and 1798 transitions. [2025-01-09 22:19:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:19:16,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-09 22:19:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:16,335 INFO L225 Difference]: With dead ends: 1355 [2025-01-09 22:19:16,335 INFO L226 Difference]: Without dead ends: 1355 [2025-01-09 22:19:16,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:19:16,335 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 288 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:16,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1028 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-01-09 22:19:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1018. [2025-01-09 22:19:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 904 states have (on average 1.3938053097345133) internal successors, (1260), 973 states have internal predecessors, (1260), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-01-09 22:19:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1374 transitions. [2025-01-09 22:19:16,357 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1374 transitions. Word has length 51 [2025-01-09 22:19:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:16,357 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1374 transitions. [2025-01-09 22:19:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1374 transitions. [2025-01-09 22:19:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:19:16,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:16,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:16,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 22:19:16,362 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -432651062, now seen corresponding path program 1 times [2025-01-09 22:19:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112644114] [2025-01-09 22:19:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:16,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:19:16,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:19:16,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:16,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112644114] [2025-01-09 22:19:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112644114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:16,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:19:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167897773] [2025-01-09 22:19:16,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:16,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:19:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:16,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:19:16,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:19:16,566 INFO L87 Difference]: Start difference. First operand 1018 states and 1374 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:16,765 INFO L93 Difference]: Finished difference Result 1334 states and 1767 transitions. [2025-01-09 22:19:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:19:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:19:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:16,771 INFO L225 Difference]: With dead ends: 1334 [2025-01-09 22:19:16,771 INFO L226 Difference]: Without dead ends: 1334 [2025-01-09 22:19:16,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:19:16,771 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 160 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:16,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 801 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-01-09 22:19:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1128. [2025-01-09 22:19:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1002 states have (on average 1.3952095808383234) internal successors, (1398), 1077 states have internal predecessors, (1398), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-01-09 22:19:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1530 transitions. [2025-01-09 22:19:16,783 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1530 transitions. Word has length 54 [2025-01-09 22:19:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:16,783 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1530 transitions. [2025-01-09 22:19:16,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1530 transitions. [2025-01-09 22:19:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:19:16,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:16,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 22:19:16,785 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash 376695564, now seen corresponding path program 1 times [2025-01-09 22:19:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423062555] [2025-01-09 22:19:16,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:16,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:19:16,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:19:16,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:16,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423062555] [2025-01-09 22:19:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423062555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878512153] [2025-01-09 22:19:17,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:17,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:17,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:17,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:19:17,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:19:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:19:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:19:17,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:17,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:19:17,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:17,447 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 [2025-01-09 22:19:17,498 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 22 [2025-01-09 22:19:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:19:17,661 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:19:17,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-01-09 22:19:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:17,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:19:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878512153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:17,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:19:17,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-01-09 22:19:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85845247] [2025-01-09 22:19:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:17,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:19:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:17,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:19:17,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:19:17,671 INFO L87 Difference]: Start difference. First operand 1128 states and 1530 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:18,030 INFO L93 Difference]: Finished difference Result 1336 states and 1768 transitions. [2025-01-09 22:19:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:19:18,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:19:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:18,033 INFO L225 Difference]: With dead ends: 1336 [2025-01-09 22:19:18,034 INFO L226 Difference]: Without dead ends: 1336 [2025-01-09 22:19:18,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:19:18,034 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 357 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:18,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 927 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 452 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:19:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-01-09 22:19:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1128. [2025-01-09 22:19:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1002 states have (on average 1.3952095808383234) internal successors, (1398), 1077 states have internal predecessors, (1398), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-01-09 22:19:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1530 transitions. [2025-01-09 22:19:18,044 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1530 transitions. Word has length 54 [2025-01-09 22:19:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:18,044 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1530 transitions. [2025-01-09 22:19:18,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1530 transitions. [2025-01-09 22:19:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:19:18,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:18,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:18,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:19:18,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:18,250 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:18,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:18,250 INFO L85 PathProgramCache]: Analyzing trace with hash -196507633, now seen corresponding path program 1 times [2025-01-09 22:19:18,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:18,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041436960] [2025-01-09 22:19:18,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:18,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:19:18,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:19:18,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:18,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041436960] [2025-01-09 22:19:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041436960] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779538785] [2025-01-09 22:19:18,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:18,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:18,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:18,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:19:18,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:19:18,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:19:18,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:19:18,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:18,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:18,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 22:19:18,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:18,865 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 [2025-01-09 22:19:18,907 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 15 [2025-01-09 22:19:18,972 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 [2025-01-09 22:19:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:18,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:19:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779538785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:18,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:19:18,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-01-09 22:19:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139786338] [2025-01-09 22:19:18,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:18,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:19:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:18,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:19:18,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:19:18,980 INFO L87 Difference]: Start difference. First operand 1128 states and 1530 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:19,341 INFO L93 Difference]: Finished difference Result 1438 states and 1901 transitions. [2025-01-09 22:19:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:19:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:19:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:19,344 INFO L225 Difference]: With dead ends: 1438 [2025-01-09 22:19:19,344 INFO L226 Difference]: Without dead ends: 1438 [2025-01-09 22:19:19,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:19:19,344 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 302 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:19,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1757 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:19:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-01-09 22:19:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1211. [2025-01-09 22:19:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1077 states have (on average 1.4001857010213556) internal successors, (1508), 1156 states have internal predecessors, (1508), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-01-09 22:19:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1652 transitions. [2025-01-09 22:19:19,359 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1652 transitions. Word has length 54 [2025-01-09 22:19:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:19,359 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1652 transitions. [2025-01-09 22:19:19,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1652 transitions. [2025-01-09 22:19:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:19:19,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:19,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:19,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:19:19,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-01-09 22:19:19,561 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:19,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash 612838993, now seen corresponding path program 1 times [2025-01-09 22:19:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:19,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866213087] [2025-01-09 22:19:19,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:19,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:19:19,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:19:19,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:19,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866213087] [2025-01-09 22:19:19,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866213087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:19:19,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:19:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:19:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23508247] [2025-01-09 22:19:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:19:19,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:19:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:19,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:19:19,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:19:19,723 INFO L87 Difference]: Start difference. First operand 1211 states and 1652 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:19,949 INFO L93 Difference]: Finished difference Result 1424 states and 1896 transitions. [2025-01-09 22:19:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:19:19,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-09 22:19:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:19,952 INFO L225 Difference]: With dead ends: 1424 [2025-01-09 22:19:19,952 INFO L226 Difference]: Without dead ends: 1424 [2025-01-09 22:19:19,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:19:19,953 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 366 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:19,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 926 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:19:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-01-09 22:19:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1102. [2025-01-09 22:19:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 980 states have (on average 1.3989795918367347) internal successors, (1371), 1053 states have internal predecessors, (1371), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2025-01-09 22:19:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1497 transitions. [2025-01-09 22:19:19,976 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1497 transitions. Word has length 54 [2025-01-09 22:19:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:19,976 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1497 transitions. [2025-01-09 22:19:19,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:19:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1497 transitions. [2025-01-09 22:19:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:19:19,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:19,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:19,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 22:19:19,977 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 247032249, now seen corresponding path program 1 times [2025-01-09 22:19:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173294972] [2025-01-09 22:19:19,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:19,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:19:20,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:19:20,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:20,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:19:20,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:20,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173294972] [2025-01-09 22:19:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173294972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:20,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218658261] [2025-01-09 22:19:20,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:20,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:20,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:19:20,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:19:20,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:19:20,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:19:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:20,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-09 22:19:20,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:20,928 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 [2025-01-09 22:19:21,212 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 [2025-01-09 22:19:21,219 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 [2025-01-09 22:19:21,295 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 21 treesize of output 20 [2025-01-09 22:19:21,299 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 36 treesize of output 27 [2025-01-09 22:19:21,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:19:21,451 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 [2025-01-09 22:19:21,475 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-01-09 22:19:21,475 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 [2025-01-09 22:19:21,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-01-09 22:19:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:21,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:19:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218658261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:21,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:19:21,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 29 [2025-01-09 22:19:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322949238] [2025-01-09 22:19:21,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:19:21,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:19:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:21,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:19:21,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:19:21,859 INFO L87 Difference]: Start difference. First operand 1102 states and 1497 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:19:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:19:23,823 INFO L93 Difference]: Finished difference Result 1985 states and 2588 transitions. [2025-01-09 22:19:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 22:19:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-01-09 22:19:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:19:23,826 INFO L225 Difference]: With dead ends: 1985 [2025-01-09 22:19:23,826 INFO L226 Difference]: Without dead ends: 1985 [2025-01-09 22:19:23,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=601, Invalid=4369, Unknown=0, NotChecked=0, Total=4970 [2025-01-09 22:19:23,827 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1110 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:19:23,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2632 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:19:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-01-09 22:19:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1364. [2025-01-09 22:19:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1210 states have (on average 1.3958677685950414) internal successors, (1689), 1297 states have internal predecessors, (1689), 58 states have call successors, (58), 29 states have call predecessors, (58), 58 states have return successors, (116), 37 states have call predecessors, (116), 58 states have call successors, (116) [2025-01-09 22:19:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1863 transitions. [2025-01-09 22:19:23,840 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1863 transitions. Word has length 56 [2025-01-09 22:19:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:19:23,840 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1863 transitions. [2025-01-09 22:19:23,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 27 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:19:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1863 transitions. [2025-01-09 22:19:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:19:23,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:19:23,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:19:23,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:19:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:24,041 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-09 22:19:24,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:19:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 247032248, now seen corresponding path program 1 times [2025-01-09 22:19:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:19:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458821758] [2025-01-09 22:19:24,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:19:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:19:24,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:19:24,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:24,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:19:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:19:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458821758] [2025-01-09 22:19:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458821758] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470270547] [2025-01-09 22:19:24,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:19:24,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:19:24,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:19:24,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:19:24,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:19:24,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:19:24,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:19:24,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:19:24,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:19:24,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:19:24,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:19:24,555 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 [2025-01-09 22:19:24,595 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 22 [2025-01-09 22:19:24,653 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2025-01-09 22:19:24,654 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 21 treesize of output 23 [2025-01-09 22:19:28,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:19:28,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-01-09 22:19:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:19:28,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:19:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470270547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:19:28,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:19:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2025-01-09 22:19:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234403997] [2025-01-09 22:19:28,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:19:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:19:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:19:28,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:19:28,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=438, Unknown=1, NotChecked=0, Total=506 [2025-01-09 22:19:28,878 INFO L87 Difference]: Start difference. First operand 1364 states and 1863 transitions. Second operand has 20 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:19:37,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:19:49,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:19:53,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:19:57,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:20:01,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:20:05,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:20:09,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:20:13,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:20:17,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]