./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8766bce70caf52d4c6325abb7a1890b0318b4da8a14d12d8fcd68cfea8e9ccc --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:23:43,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:23:43,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:23:43,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:23:43,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:23:43,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:23:43,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:23:43,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:23:43,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:23:43,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:23:43,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:23:43,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:23:43,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:23:43,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:23:43,847 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:23:43,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:23:43,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:43,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:43,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:43,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:23:43,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:23:43,849 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/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 -> a8766bce70caf52d4c6325abb7a1890b0318b4da8a14d12d8fcd68cfea8e9ccc [2025-04-29 11:23:44,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:23:44,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:23:44,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:23:44,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:23:44,067 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:23:44,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04-2.c [2025-04-29 11:23:45,336 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38e08b92/c5761b2b5a6b4f93b161c611b82d50f3/FLAGd6eab3416 [2025-04-29 11:23:45,502 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:23:45,502 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04-2.c [2025-04-29 11:23:45,503 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:45,503 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:45,515 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38e08b92/c5761b2b5a6b4f93b161c611b82d50f3/FLAGd6eab3416 [2025-04-29 11:23:46,336 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38e08b92/c5761b2b5a6b4f93b161c611b82d50f3 [2025-04-29 11:23:46,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:23:46,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:23:46,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:23:46,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:23:46,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:23:46,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5dbfc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46, skipping insertion in model container [2025-04-29 11:23:46,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:23:46,492 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:23:46,505 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:23:46,511 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:23:46,534 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:23:46,548 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:23:46,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46 WrapperNode [2025-04-29 11:23:46,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:23:46,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:23:46,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:23:46,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:23:46,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,575 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2025-04-29 11:23:46,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:23:46,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:23:46,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:23:46,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:23:46,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,607 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [8, 11]. 58 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 8 writes are split as follows [2, 6]. [2025-04-29 11:23:46,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:23:46,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:23:46,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:23:46,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:23:46,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (1/1) ... [2025-04-29 11:23:46,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:46,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:46,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:23:46,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:23:46,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:23:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:23:46,729 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:23:46,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:23:47,004 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-04-29 11:23:47,004 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:23:47,012 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:23:47,013 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:23:47,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:47 BoogieIcfgContainer [2025-04-29 11:23:47,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:23:47,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:23:47,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:23:47,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:23:47,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:23:46" (1/3) ... [2025-04-29 11:23:47,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724197d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:47, skipping insertion in model container [2025-04-29 11:23:47,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:46" (2/3) ... [2025-04-29 11:23:47,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724197d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:47, skipping insertion in model container [2025-04-29 11:23:47,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:47" (3/3) ... [2025-04-29 11:23:47,023 INFO L128 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.c [2025-04-29 11:23:47,033 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:23:47,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-2.c that has 1 procedures, 100 locations, 108 edges, 1 initial locations, 3 loop locations, and 46 error locations. [2025-04-29 11:23:47,065 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:23:47,072 INFO L340 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;@1e8a95a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:23:47,073 INFO L341 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-04-29 11:23:47,075 INFO L278 IsEmpty]: Start isEmpty. Operand has 100 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 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-04-29 11:23:47,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:23:47,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:47,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:23:47,079 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:47,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 927656, now seen corresponding path program 1 times [2025-04-29 11:23:47,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:47,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40981024] [2025-04-29 11:23:47,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:47,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:23:47,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:23:47,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:47,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:47,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:47,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40981024] [2025-04-29 11:23:47,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40981024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:47,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:47,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867170652] [2025-04-29 11:23:47,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:47,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:23:47,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:23:47,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:23:47,179 INFO L87 Difference]: Start difference. First operand has 100 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:47,193 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-04-29 11:23:47,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:23:47,194 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:23:47,195 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:47,198 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:23:47,199 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:23:47,201 INFO L436 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-04-29 11:23:47,204 INFO L437 NwaCegarLoop]: 106 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, 106 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-04-29 11:23:47,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:23:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-04-29 11:23:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 2.0) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-04-29 11:23:47,228 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 4 [2025-04-29 11:23:47,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:47,228 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-04-29 11:23:47,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,229 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-04-29 11:23:47,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:23:47,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:47,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:23:47,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:23:47,229 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:47,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-04-29 11:23:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:47,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044315390] [2025-04-29 11:23:47,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:47,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:23:47,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:23:47,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:47,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-04-29 11:23:47,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:47,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044315390] [2025-04-29 11:23:47,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044315390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:47,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:47,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654655963] [2025-04-29 11:23:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:47,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:47,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:47,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:47,358 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:47,510 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2025-04-29 11:23:47,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:47,511 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:23:47,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:47,511 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:23:47,511 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:23:47,512 INFO L436 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-04-29 11:23:47,512 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:47,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 89 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:23:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-04-29 11:23:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-04-29 11:23:47,519 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 4 [2025-04-29 11:23:47,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:47,519 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-04-29 11:23:47,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,519 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-04-29 11:23:47,519 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:23:47,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:47,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:23:47,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:23:47,521 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:47,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-04-29 11:23:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:47,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529019599] [2025-04-29 11:23:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:47,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:23:47,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:23:47,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:47,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:47,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529019599] [2025-04-29 11:23:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529019599] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:47,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497838185] [2025-04-29 11:23:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:47,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:47,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:47,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:47,631 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:47,787 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2025-04-29 11:23:47,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:47,787 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:23:47,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:47,788 INFO L225 Difference]: With dead ends: 141 [2025-04-29 11:23:47,788 INFO L226 Difference]: Without dead ends: 141 [2025-04-29 11:23:47,788 INFO L436 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-04-29 11:23:47,789 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 96 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:47,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 108 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-29 11:23:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2025-04-29 11:23:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 108 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2025-04-29 11:23:47,796 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 4 [2025-04-29 11:23:47,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:47,796 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2025-04-29 11:23:47,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,796 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2025-04-29 11:23:47,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:23:47,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:47,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:23:47,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:23:47,796 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:47,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2025-04-29 11:23:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:47,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004347478] [2025-04-29 11:23:47,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:47,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:23:47,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:23:47,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:47,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:47,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004347478] [2025-04-29 11:23:47,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004347478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:47,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457034468] [2025-04-29 11:23:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:47,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:47,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:47,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:47,841 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:47,897 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-04-29 11:23:47,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:47,898 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:23:47,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:47,899 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:23:47,899 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:23:47,899 INFO L436 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-04-29 11:23:47,901 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:47,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:23:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-29 11:23:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 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-04-29 11:23:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2025-04-29 11:23:47,909 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 5 [2025-04-29 11:23:47,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:47,910 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2025-04-29 11:23:47,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:47,910 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2025-04-29 11:23:47,910 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:23:47,910 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:47,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:23:47,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:23:47,910 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:47,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2025-04-29 11:23:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:47,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405096196] [2025-04-29 11:23:47,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:47,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:23:47,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:23:47,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:47,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:47,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405096196] [2025-04-29 11:23:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405096196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:47,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144300492] [2025-04-29 11:23:47,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:47,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:47,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:47,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:47,968 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:48,022 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2025-04-29 11:23:48,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:48,022 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:23:48,022 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:48,023 INFO L225 Difference]: With dead ends: 116 [2025-04-29 11:23:48,023 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:23:48,023 INFO L436 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-04-29 11:23:48,024 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:48,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:23:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2025-04-29 11:23:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 110 states have internal predecessors, (126), 0 states have call successors, (0), 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-04-29 11:23:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2025-04-29 11:23:48,030 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 5 [2025-04-29 11:23:48,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:48,033 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2025-04-29 11:23:48,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,033 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2025-04-29 11:23:48,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:23:48,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:48,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:48,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:23:48,034 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:48,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2025-04-29 11:23:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:48,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677571110] [2025-04-29 11:23:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:48,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:23:48,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:23:48,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:48,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677571110] [2025-04-29 11:23:48,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677571110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:48,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:48,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937451561] [2025-04-29 11:23:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:48,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:48,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:48,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:48,100 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:48,155 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-04-29 11:23:48,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:48,156 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:23:48,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:48,156 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:23:48,156 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:23:48,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:48,157 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 14 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:48,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:23:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-29 11:23:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.635135135135135) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 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-04-29 11:23:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2025-04-29 11:23:48,163 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 9 [2025-04-29 11:23:48,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:48,163 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2025-04-29 11:23:48,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,163 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2025-04-29 11:23:48,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:23:48,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:48,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:48,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:23:48,164 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:48,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2025-04-29 11:23:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:48,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129120479] [2025-04-29 11:23:48,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:48,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:23:48,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:23:48,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:48,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:48,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129120479] [2025-04-29 11:23:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129120479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816412475] [2025-04-29 11:23:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:48,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:48,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:48,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:48,282 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:48,350 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-04-29 11:23:48,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:48,350 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:23:48,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:48,351 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:23:48,351 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:23:48,351 INFO L436 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-04-29 11:23:48,351 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:48,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:23:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-04-29 11:23:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 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-04-29 11:23:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-04-29 11:23:48,359 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 9 [2025-04-29 11:23:48,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:48,359 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-04-29 11:23:48,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,359 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-04-29 11:23:48,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:23:48,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:48,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:48,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:23:48,360 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:48,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1431624144, now seen corresponding path program 1 times [2025-04-29 11:23:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:48,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831435834] [2025-04-29 11:23:48,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:48,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:23:48,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:23:48,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:48,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831435834] [2025-04-29 11:23:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831435834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:48,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251206879] [2025-04-29 11:23:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:48,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:48,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:48,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:48,455 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:48,539 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2025-04-29 11:23:48,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:48,540 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:23:48,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:48,540 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:23:48,541 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:23:48,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:48,543 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:48,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 221 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:23:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-04-29 11:23:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 78 states have (on average 1.564102564102564) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 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-04-29 11:23:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2025-04-29 11:23:48,546 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 14 [2025-04-29 11:23:48,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:48,546 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2025-04-29 11:23:48,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,546 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2025-04-29 11:23:48,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:23:48,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:48,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:48,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:23:48,547 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:48,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1431624145, now seen corresponding path program 1 times [2025-04-29 11:23:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:48,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887606056] [2025-04-29 11:23:48,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:48,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:23:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:23:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:48,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887606056] [2025-04-29 11:23:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887606056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:48,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:48,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116381054] [2025-04-29 11:23:48,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:48,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:48,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:48,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:48,735 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:48,836 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2025-04-29 11:23:48,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:48,836 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:23:48,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:48,837 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:23:48,837 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:23:48,837 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:48,838 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 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-04-29 11:23:48,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:23:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-29 11:23:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 106 states have internal predecessors, (120), 0 states have call successors, (0), 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-04-29 11:23:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2025-04-29 11:23:48,843 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 14 [2025-04-29 11:23:48,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:48,843 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2025-04-29 11:23:48,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:48,843 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2025-04-29 11:23:48,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:23:48,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:48,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:48,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:23:48,844 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:48,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2100473481, now seen corresponding path program 1 times [2025-04-29 11:23:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:48,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530649755] [2025-04-29 11:23:48,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:23:48,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:23:48,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:48,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:48,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:48,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530649755] [2025-04-29 11:23:48,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530649755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:48,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:23:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524828695] [2025-04-29 11:23:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:48,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:23:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:48,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:23:48,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:48,978 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:49,042 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-04-29 11:23:49,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:49,043 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:23:49,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:49,043 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:23:49,043 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:23:49,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:49,044 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:49,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 112 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:23:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-04-29 11:23:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.554054054054054) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 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-04-29 11:23:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-04-29 11:23:49,047 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 16 [2025-04-29 11:23:49,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:49,047 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-04-29 11:23:49,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:49,047 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-04-29 11:23:49,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:23:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:49,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:49,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:23:49,049 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:49,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 282100697, now seen corresponding path program 1 times [2025-04-29 11:23:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:49,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79607150] [2025-04-29 11:23:49,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:49,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:23:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:23:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:49,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79607150] [2025-04-29 11:23:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79607150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:49,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659471729] [2025-04-29 11:23:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:49,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:49,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:49,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:49,146 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-04-29 11:23:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:49,211 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2025-04-29 11:23:49,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:49,211 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-04-29 11:23:49,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:49,212 INFO L225 Difference]: With dead ends: 167 [2025-04-29 11:23:49,212 INFO L226 Difference]: Without dead ends: 167 [2025-04-29 11:23:49,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:49,213 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 86 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:49,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 288 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-29 11:23:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2025-04-29 11:23:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 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-04-29 11:23:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-04-29 11:23:49,216 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 17 [2025-04-29 11:23:49,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:49,216 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-04-29 11:23:49,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-04-29 11:23:49,216 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-04-29 11:23:49,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:23:49,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:49,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:49,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:23:49,217 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:49,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash 282096825, now seen corresponding path program 1 times [2025-04-29 11:23:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:49,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959242458] [2025-04-29 11:23:49,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:49,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:23:49,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:23:49,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:49,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:49,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959242458] [2025-04-29 11:23:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959242458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950127283] [2025-04-29 11:23:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:49,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:49,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:49,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:49,304 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-04-29 11:23:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:49,463 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2025-04-29 11:23:49,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:23:49,463 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-04-29 11:23:49,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:49,464 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:23:49,464 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:23:49,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:23:49,464 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:49,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 222 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:23:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 102. [2025-04-29 11:23:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.527027027027027) internal successors, (113), 101 states have internal predecessors, (113), 0 states have call successors, (0), 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-04-29 11:23:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2025-04-29 11:23:49,469 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 17 [2025-04-29 11:23:49,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:49,469 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2025-04-29 11:23:49,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-04-29 11:23:49,469 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2025-04-29 11:23:49,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:23:49,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:49,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:49,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:23:49,471 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:49,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash 282096826, now seen corresponding path program 1 times [2025-04-29 11:23:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:49,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521927527] [2025-04-29 11:23:49,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:49,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:23:49,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:23:49,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:49,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:49,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:49,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521927527] [2025-04-29 11:23:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521927527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116746804] [2025-04-29 11:23:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:49,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:49,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:49,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:49,627 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-04-29 11:23:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:49,776 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2025-04-29 11:23:49,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:49,777 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-04-29 11:23:49,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:49,777 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:23:49,777 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:23:49,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:49,779 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 76 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:49,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 215 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:23:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 96. [2025-04-29 11:23:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.536231884057971) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 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-04-29 11:23:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-04-29 11:23:49,782 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 17 [2025-04-29 11:23:49,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:49,783 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-04-29 11:23:49,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-04-29 11:23:49,784 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-04-29 11:23:49,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:23:49,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:49,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:49,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:23:49,784 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:49,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1910703943, now seen corresponding path program 1 times [2025-04-29 11:23:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:49,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707141137] [2025-04-29 11:23:49,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:49,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:49,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707141137] [2025-04-29 11:23:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707141137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:49,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999260397] [2025-04-29 11:23:49,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:49,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:49,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:49,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:23:49,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:49,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:49,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:23:49,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:50,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:50,047 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:23:50,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:23:50,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:50,159 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:50,160 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-29 11:23:50,183 INFO L354 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 31 treesize of output 13 [2025-04-29 11:23:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:50,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:50,269 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_239) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) 1)) is different from false [2025-04-29 11:23:50,283 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:50,284 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:23:50,288 INFO L354 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 40 treesize of output 28 [2025-04-29 11:23:50,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-04-29 11:23:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 11:23:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999260397] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:50,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2025-04-29 11:23:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399873068] [2025-04-29 11:23:50,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:50,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:23:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:23:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=156, Unknown=6, NotChecked=26, Total=240 [2025-04-29 11:23:50,341 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:50,534 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2025-04-29 11:23:50,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:50,534 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:23:50,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:50,535 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:23:50,535 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:23:50,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=156, Unknown=6, NotChecked=26, Total=240 [2025-04-29 11:23:50,535 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:50,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 436 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2025-04-29 11:23:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:23:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-04-29 11:23:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 94 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2025-04-29 11:23:50,537 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 19 [2025-04-29 11:23:50,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:50,537 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2025-04-29 11:23:50,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:50,537 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2025-04-29 11:23:50,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:23:50,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:50,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:50,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:50,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:23:50,744 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:50,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1910703942, now seen corresponding path program 1 times [2025-04-29 11:23:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:50,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074643617] [2025-04-29 11:23:50,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:50,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:50,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:50,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:50,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:50,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074643617] [2025-04-29 11:23:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074643617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:50,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092580323] [2025-04-29 11:23:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:50,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:50,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:23:51,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:51,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:51,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:51,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:51,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:23:51,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:51,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:51,080 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:51,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:23:51,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:23:51,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:51,112 INFO L354 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-04-29 11:23:51,221 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:51,222 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:51,232 INFO L354 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 30 treesize of output 13 [2025-04-29 11:23:51,282 INFO L354 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 31 treesize of output 13 [2025-04-29 11:23:51,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:23:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:51,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:51,397 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_297) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_297) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-04-29 11:23:51,418 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2025-04-29 11:23:51,433 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4)))))) is different from false [2025-04-29 11:23:51,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:51,440 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-04-29 11:23:51,445 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:51,445 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:23:51,449 INFO L354 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 62 treesize of output 50 [2025-04-29 11:23:51,454 INFO L354 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 96 treesize of output 78 [2025-04-29 11:23:51,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:23:51,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:23:51,470 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:51,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:23:51,473 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:51,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:23:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-29 11:23:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092580323] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:51,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:51,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2025-04-29 11:23:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643635913] [2025-04-29 11:23:51,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:51,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:23:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:51,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:23:51,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=353, Unknown=3, NotChecked=120, Total=552 [2025-04-29 11:23:51,517 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:51,880 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-04-29 11:23:51,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:23:51,880 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:23:51,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:51,881 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:23:51,881 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:23:51,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=568, Unknown=3, NotChecked=156, Total=870 [2025-04-29 11:23:51,882 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:51,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 690 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 437 Invalid, 0 Unknown, 148 Unchecked, 0.2s Time] [2025-04-29 11:23:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:23:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:23:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 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-04-29 11:23:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-04-29 11:23:51,884 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 19 [2025-04-29 11:23:51,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:51,884 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-04-29 11:23:51,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:51,885 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-04-29 11:23:51,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:23:51,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:51,885 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] [2025-04-29 11:23:51,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:52,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:23:52,086 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:52,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1304427068, now seen corresponding path program 1 times [2025-04-29 11:23:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:52,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181092452] [2025-04-29 11:23:52,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:52,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:23:52,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:23:52,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:52,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:52,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181092452] [2025-04-29 11:23:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181092452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545956428] [2025-04-29 11:23:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:52,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:52,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:52,159 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:52,281 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2025-04-29 11:23:52,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:52,282 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:23:52,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:52,282 INFO L225 Difference]: With dead ends: 157 [2025-04-29 11:23:52,282 INFO L226 Difference]: Without dead ends: 157 [2025-04-29 11:23:52,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:52,283 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:52,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 224 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-29 11:23:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 100. [2025-04-29 11:23:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.472972972972973) internal successors, (109), 99 states have internal predecessors, (109), 0 states have call successors, (0), 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-04-29 11:23:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-04-29 11:23:52,285 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 20 [2025-04-29 11:23:52,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:52,285 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-04-29 11:23:52,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,285 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-04-29 11:23:52,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:23:52,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:52,286 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] [2025-04-29 11:23:52,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:23:52,286 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:52,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1304427067, now seen corresponding path program 1 times [2025-04-29 11:23:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:52,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281781985] [2025-04-29 11:23:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:52,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:23:52,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:23:52,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:52,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:52,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281781985] [2025-04-29 11:23:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281781985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:52,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130523550] [2025-04-29 11:23:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:52,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:52,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:52,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:52,414 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:52,531 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2025-04-29 11:23:52,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:52,531 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:23:52,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:52,532 INFO L225 Difference]: With dead ends: 159 [2025-04-29 11:23:52,532 INFO L226 Difference]: Without dead ends: 159 [2025-04-29 11:23:52,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:52,532 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:52,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 211 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-29 11:23:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 100. [2025-04-29 11:23:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 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-04-29 11:23:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-04-29 11:23:52,534 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 20 [2025-04-29 11:23:52,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:52,534 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-04-29 11:23:52,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,534 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-04-29 11:23:52,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:23:52,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:52,535 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-04-29 11:23:52,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:23:52,535 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:52,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash 677376126, now seen corresponding path program 1 times [2025-04-29 11:23:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:52,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130830675] [2025-04-29 11:23:52,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:52,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:52,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:52,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:52,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130830675] [2025-04-29 11:23:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130830675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:23:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568649775] [2025-04-29 11:23:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:52,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:52,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:52,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:52,726 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:52,880 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2025-04-29 11:23:52,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:52,880 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:23:52,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:52,881 INFO L225 Difference]: With dead ends: 127 [2025-04-29 11:23:52,881 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 11:23:52,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:23:52,881 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:52,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 471 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 11:23:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2025-04-29 11:23:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 114 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-04-29 11:23:52,884 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 23 [2025-04-29 11:23:52,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:52,884 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-04-29 11:23:52,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:52,884 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-04-29 11:23:52,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:23:52,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:52,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:52,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:23:52,885 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:52,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1364247409, now seen corresponding path program 2 times [2025-04-29 11:23:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:52,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398757175] [2025-04-29 11:23:52,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:52,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:23:52,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:23:52,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:53,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398757175] [2025-04-29 11:23:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398757175] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:53,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355413383] [2025-04-29 11:23:53,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:53,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:53,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:53,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:53,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:23:53,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:23:53,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:23:53,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:53,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:53,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:23:53,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:53,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:53,303 INFO L354 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-04-29 11:23:53,308 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:53,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:23:53,331 INFO L354 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-04-29 11:23:53,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:53,429 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:53,429 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:53,433 INFO L354 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 30 treesize of output 13 [2025-04-29 11:23:53,513 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:53,513 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:53,517 INFO L354 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 30 treesize of output 13 [2025-04-29 11:23:53,557 INFO L354 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 31 treesize of output 13 [2025-04-29 11:23:53,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:23:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:53,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:53,705 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_434 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:23:53,722 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_434 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) is different from false [2025-04-29 11:23:53,734 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_432))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_432) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2025-04-29 11:23:53,753 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_432))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_433) .cse2 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_432) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)))))) is different from false [2025-04-29 11:23:53,778 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_432) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_432))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) .cse2 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))))) is different from false [2025-04-29 11:23:53,787 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:53,787 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-04-29 11:23:53,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:53,791 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-04-29 11:23:53,793 INFO L354 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 64 treesize of output 52 [2025-04-29 11:23:53,796 INFO L354 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 220 treesize of output 196 [2025-04-29 11:23:53,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2025-04-29 11:23:53,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:23:53,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:23:53,814 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:53,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-04-29 11:23:53,819 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:53,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-04-29 11:23:53,821 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:53,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-04-29 11:23:53,825 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:53,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 11:23:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-04-29 11:23:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355413383] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:53,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 30 [2025-04-29 11:23:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717893365] [2025-04-29 11:23:53,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:53,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:23:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:53,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:23:53,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=548, Unknown=11, NotChecked=260, Total=930 [2025-04-29 11:23:53,867 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 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-04-29 11:23:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:54,470 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2025-04-29 11:23:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:23:54,470 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 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 24 [2025-04-29 11:23:54,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:54,471 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:23:54,471 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:23:54,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1100, Unknown=13, NotChecked=370, Total=1722 [2025-04-29 11:23:54,472 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:54,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 738 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 22 Unknown, 302 Unchecked, 0.3s Time] [2025-04-29 11:23:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:23:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-04-29 11:23:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 124 states have internal predecessors, (135), 0 states have call successors, (0), 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-04-29 11:23:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2025-04-29 11:23:54,474 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 24 [2025-04-29 11:23:54,474 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,474 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2025-04-29 11:23:54,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 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-04-29 11:23:54,474 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2025-04-29 11:23:54,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:23:54,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,475 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-04-29 11:23:54,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:54,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:54,676 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:54,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1876604357, now seen corresponding path program 1 times [2025-04-29 11:23:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011086278] [2025-04-29 11:23:54,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:23:54,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:23:54,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:54,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011086278] [2025-04-29 11:23:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011086278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452210253] [2025-04-29 11:23:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:54,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:54,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:54,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:54,743 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:54,792 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2025-04-29 11:23:54,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:54,792 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:23:54,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:54,793 INFO L225 Difference]: With dead ends: 152 [2025-04-29 11:23:54,793 INFO L226 Difference]: Without dead ends: 152 [2025-04-29 11:23:54,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:54,793 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:54,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 220 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-04-29 11:23:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2025-04-29 11:23:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 136 states have internal predecessors, (160), 0 states have call successors, (0), 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-04-29 11:23:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2025-04-29 11:23:54,797 INFO L79 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 25 [2025-04-29 11:23:54,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,797 INFO L485 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2025-04-29 11:23:54,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,798 INFO L278 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2025-04-29 11:23:54,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:23:54,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,798 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-04-29 11:23:54,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:23:54,798 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:54,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1954807240, now seen corresponding path program 1 times [2025-04-29 11:23:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011120322] [2025-04-29 11:23:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:23:54,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:23:54,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:54,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011120322] [2025-04-29 11:23:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011120322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:54,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12101638] [2025-04-29 11:23:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:54,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:54,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:54,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:54,867 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:54,949 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2025-04-29 11:23:54,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:54,950 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:23:54,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:54,950 INFO L225 Difference]: With dead ends: 196 [2025-04-29 11:23:54,951 INFO L226 Difference]: Without dead ends: 196 [2025-04-29 11:23:54,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:54,951 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 68 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:54,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 242 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-29 11:23:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 138. [2025-04-29 11:23:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.4375) internal successors, (161), 137 states have internal predecessors, (161), 0 states have call successors, (0), 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-04-29 11:23:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2025-04-29 11:23:54,956 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 26 [2025-04-29 11:23:54,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,956 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2025-04-29 11:23:54,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,956 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2025-04-29 11:23:54,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:54,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,956 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-04-29 11:23:54,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:23:54,957 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:54,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 469482461, now seen corresponding path program 1 times [2025-04-29 11:23:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199559084] [2025-04-29 11:23:54,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:54,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:54,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:55,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:55,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199559084] [2025-04-29 11:23:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199559084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255978665] [2025-04-29 11:23:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:55,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:55,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:55,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:55,023 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,141 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2025-04-29 11:23:55,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:55,142 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:23:55,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,142 INFO L225 Difference]: With dead ends: 199 [2025-04-29 11:23:55,142 INFO L226 Difference]: Without dead ends: 199 [2025-04-29 11:23:55,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:55,143 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,143 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 226 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-04-29 11:23:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2025-04-29 11:23:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 140 states have internal predecessors, (164), 0 states have call successors, (0), 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-04-29 11:23:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2025-04-29 11:23:55,146 INFO L79 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 27 [2025-04-29 11:23:55,146 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,146 INFO L485 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2025-04-29 11:23:55,146 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:55,146 INFO L278 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2025-04-29 11:23:55,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:55,147 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,147 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-04-29 11:23:55,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:23:55,147 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:55,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1669054571, now seen corresponding path program 1 times [2025-04-29 11:23:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756428145] [2025-04-29 11:23:55,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:55,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:55,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:55,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756428145] [2025-04-29 11:23:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756428145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:23:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723765349] [2025-04-29 11:23:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:55,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:55,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:55,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:55,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:55,274 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,420 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2025-04-29 11:23:55,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:23:55,421 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:55,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,421 INFO L225 Difference]: With dead ends: 160 [2025-04-29 11:23:55,421 INFO L226 Difference]: Without dead ends: 160 [2025-04-29 11:23:55,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:23:55,422 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 224 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 126 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-29 11:23:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2025-04-29 11:23:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 139 states have internal predecessors, (163), 0 states have call successors, (0), 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-04-29 11:23:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2025-04-29 11:23:55,426 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 28 [2025-04-29 11:23:55,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,427 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2025-04-29 11:23:55,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:55,427 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2025-04-29 11:23:55,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:55,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,427 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-04-29 11:23:55,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:23:55,427 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:55,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1669054572, now seen corresponding path program 1 times [2025-04-29 11:23:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303892958] [2025-04-29 11:23:55,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:55,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303892958] [2025-04-29 11:23:55,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303892958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:55,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:55,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225085207] [2025-04-29 11:23:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:55,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:55,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:55,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:55,463 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,499 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2025-04-29 11:23:55,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:55,499 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:55,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,499 INFO L225 Difference]: With dead ends: 135 [2025-04-29 11:23:55,499 INFO L226 Difference]: Without dead ends: 135 [2025-04-29 11:23:55,500 INFO L436 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-04-29 11:23:55,500 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-29 11:23:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-04-29 11:23:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 134 states have internal predecessors, (156), 0 states have call successors, (0), 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-04-29 11:23:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2025-04-29 11:23:55,502 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 28 [2025-04-29 11:23:55,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,502 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2025-04-29 11:23:55,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:55,503 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2025-04-29 11:23:55,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:55,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,503 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-04-29 11:23:55,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:23:55,503 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:55,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1751539878, now seen corresponding path program 1 times [2025-04-29 11:23:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771796264] [2025-04-29 11:23:55,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:55,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:55,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:55,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:55,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771796264] [2025-04-29 11:23:55,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771796264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:55,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:55,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:23:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241507287] [2025-04-29 11:23:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:55,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:23:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:55,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:23:55,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:23:55,676 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,872 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2025-04-29 11:23:55,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:23:55,872 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:55,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,873 INFO L225 Difference]: With dead ends: 156 [2025-04-29 11:23:55,873 INFO L226 Difference]: Without dead ends: 156 [2025-04-29 11:23:55,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:23:55,873 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 73 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 304 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-29 11:23:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2025-04-29 11:23:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 139 states have internal predecessors, (163), 0 states have call successors, (0), 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-04-29 11:23:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2025-04-29 11:23:55,876 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 28 [2025-04-29 11:23:55,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,877 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2025-04-29 11:23:55,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:55,877 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2025-04-29 11:23:55,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:55,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,877 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-04-29 11:23:55,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:23:55,877 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:55,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1751539877, now seen corresponding path program 1 times [2025-04-29 11:23:55,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168148555] [2025-04-29 11:23:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:55,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:55,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:56,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168148555] [2025-04-29 11:23:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168148555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:23:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096844872] [2025-04-29 11:23:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:56,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:23:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:56,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:23:56,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:23:56,137 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:56,354 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2025-04-29 11:23:56,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:23:56,355 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:56,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:56,356 INFO L225 Difference]: With dead ends: 190 [2025-04-29 11:23:56,356 INFO L226 Difference]: Without dead ends: 190 [2025-04-29 11:23:56,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:23:56,356 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:56,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 402 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-29 11:23:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 166. [2025-04-29 11:23:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 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-04-29 11:23:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2025-04-29 11:23:56,360 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 28 [2025-04-29 11:23:56,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:56,360 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2025-04-29 11:23:56,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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-04-29 11:23:56,361 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2025-04-29 11:23:56,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:23:56,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:56,361 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] [2025-04-29 11:23:56,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:23:56,361 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:56,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash -566739907, now seen corresponding path program 1 times [2025-04-29 11:23:56,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:56,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176472300] [2025-04-29 11:23:56,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:23:56,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:23:56,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:56,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:56,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-04-29 11:23:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:56,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176472300] [2025-04-29 11:23:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176472300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:23:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393124600] [2025-04-29 11:23:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:56,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:23:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:56,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:23:56,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:23:56,606 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:56,825 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2025-04-29 11:23:56,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:23:56,825 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:23:56,825 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:56,826 INFO L225 Difference]: With dead ends: 184 [2025-04-29 11:23:56,826 INFO L226 Difference]: Without dead ends: 184 [2025-04-29 11:23:56,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:23:56,827 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 65 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:56,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 403 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-04-29 11:23:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2025-04-29 11:23:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.3129251700680271) internal successors, (193), 165 states have internal predecessors, (193), 0 states have call successors, (0), 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-04-29 11:23:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2025-04-29 11:23:56,830 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 31 [2025-04-29 11:23:56,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:56,830 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2025-04-29 11:23:56,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:56,830 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2025-04-29 11:23:56,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:23:56,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:56,831 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] [2025-04-29 11:23:56,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:23:56,831 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:56,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -566750892, now seen corresponding path program 1 times [2025-04-29 11:23:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:56,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477912806] [2025-04-29 11:23:56,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:56,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:23:56,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:23:56,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:56,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:57,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:57,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477912806] [2025-04-29 11:23:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477912806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:23:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566670732] [2025-04-29 11:23:57,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:57,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:23:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:57,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:23:57,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:23:57,347 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:57,703 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2025-04-29 11:23:57,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:23:57,703 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:23:57,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:57,704 INFO L225 Difference]: With dead ends: 188 [2025-04-29 11:23:57,704 INFO L226 Difference]: Without dead ends: 188 [2025-04-29 11:23:57,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:23:57,705 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:57,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 668 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-29 11:23:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2025-04-29 11:23:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 165 states have internal predecessors, (192), 0 states have call successors, (0), 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-04-29 11:23:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2025-04-29 11:23:57,710 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 31 [2025-04-29 11:23:57,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:57,710 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2025-04-29 11:23:57,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:57,710 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2025-04-29 11:23:57,710 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:23:57,710 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:57,711 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] [2025-04-29 11:23:57,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:23:57,711 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:57,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -389408325, now seen corresponding path program 1 times [2025-04-29 11:23:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:57,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491366834] [2025-04-29 11:23:57,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:57,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:23:57,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:23:57,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:57,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:58,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:58,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491366834] [2025-04-29 11:23:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491366834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-29 11:23:58,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730137397] [2025-04-29 11:23:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:58,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:23:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:58,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:23:58,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:23:58,189 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:58,587 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2025-04-29 11:23:58,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:23:58,588 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-29 11:23:58,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:58,588 INFO L225 Difference]: With dead ends: 180 [2025-04-29 11:23:58,588 INFO L226 Difference]: Without dead ends: 178 [2025-04-29 11:23:58,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:23:58,589 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 60 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:58,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 763 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-04-29 11:23:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2025-04-29 11:23:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.295774647887324) internal successors, (184), 160 states have internal predecessors, (184), 0 states have call successors, (0), 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-04-29 11:23:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2025-04-29 11:23:58,591 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 32 [2025-04-29 11:23:58,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:58,591 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2025-04-29 11:23:58,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:58,591 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2025-04-29 11:23:58,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:23:58,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:58,592 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:58,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:23:58,592 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:23:58,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -259579350, now seen corresponding path program 1 times [2025-04-29 11:23:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:58,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646238805] [2025-04-29 11:23:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:58,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:23:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:23:58,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:58,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646238805] [2025-04-29 11:23:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646238805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:58,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583370170] [2025-04-29 11:23:58,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:58,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:58,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:23:58,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:23:58,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:23:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:58,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 11:23:58,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:59,052 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-29 11:23:59,053 INFO L354 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 1 case distinctions, treesize of input 23 treesize of output 15 [2025-04-29 11:23:59,345 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:59,345 INFO L354 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 95 treesize of output 67 [2025-04-29 11:23:59,349 INFO L354 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 13 [2025-04-29 11:23:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:59,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:59,726 INFO L354 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 8 treesize of output 4 [2025-04-29 11:23:59,832 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_789 Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_789) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0))))) is different from false [2025-04-29 11:23:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583370170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:59,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-04-29 11:23:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581730245] [2025-04-29 11:23:59,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:59,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:23:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:59,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:23:59,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=472, Unknown=7, NotChecked=44, Total=600 [2025-04-29 11:23:59,839 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 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-04-29 11:24:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:00,698 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2025-04-29 11:24:00,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:24:00,699 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:24:00,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:00,699 INFO L225 Difference]: With dead ends: 238 [2025-04-29 11:24:00,699 INFO L226 Difference]: Without dead ends: 236 [2025-04-29 11:24:00,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=776, Unknown=7, NotChecked=58, Total=992 [2025-04-29 11:24:00,701 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 137 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:00,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 726 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 635 Invalid, 10 Unknown, 116 Unchecked, 0.6s Time] [2025-04-29 11:24:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-29 11:24:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 190. [2025-04-29 11:24:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.2573099415204678) internal successors, (215), 189 states have internal predecessors, (215), 0 states have call successors, (0), 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-04-29 11:24:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2025-04-29 11:24:00,705 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 33 [2025-04-29 11:24:00,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:00,705 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2025-04-29 11:24:00,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 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-04-29 11:24:00,705 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2025-04-29 11:24:00,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:24:00,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:00,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:00,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:24:00,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:00,906 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:24:00,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -259583222, now seen corresponding path program 1 times [2025-04-29 11:24:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:00,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494483999] [2025-04-29 11:24:00,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:00,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:24:00,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:24:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:01,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494483999] [2025-04-29 11:24:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494483999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:01,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424957486] [2025-04-29 11:24:01,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:01,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:01,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:24:01,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:24:01,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:24:01,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:01,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:01,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-29 11:24:01,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:01,466 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:01,466 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:24:01,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:24:01,512 INFO L354 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-04-29 11:24:01,588 INFO L354 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-04-29 11:24:01,600 INFO L354 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 15 [2025-04-29 11:24:01,647 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:01,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-04-29 11:24:01,768 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:01,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:01,773 INFO L354 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 29 treesize of output 19 [2025-04-29 11:24:01,786 INFO L325 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-04-29 11:24:01,786 INFO L354 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 29 treesize of output 19 [2025-04-29 11:24:01,943 INFO L354 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-04-29 11:24:01,946 INFO L354 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 19 treesize of output 11 [2025-04-29 11:24:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:01,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:02,114 INFO L354 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 8 treesize of output 4 [2025-04-29 11:24:02,241 INFO L354 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 154 treesize of output 138 [2025-04-29 11:24:02,254 INFO L354 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 56 treesize of output 40 [2025-04-29 11:24:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424957486] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:02,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2025-04-29 11:24:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837379373] [2025-04-29 11:24:02,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:02,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:24:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:24:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:24:02,369 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:02,855 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2025-04-29 11:24:02,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:24:02,856 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:24:02,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:02,856 INFO L225 Difference]: With dead ends: 236 [2025-04-29 11:24:02,856 INFO L226 Difference]: Without dead ends: 218 [2025-04-29 11:24:02,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 11:24:02,857 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 158 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:02,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1308 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:24:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-04-29 11:24:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 172. [2025-04-29 11:24:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 171 states have internal predecessors, (196), 0 states have call successors, (0), 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-04-29 11:24:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2025-04-29 11:24:02,860 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 33 [2025-04-29 11:24:02,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:02,860 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2025-04-29 11:24:02,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:02,861 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2025-04-29 11:24:02,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:24:02,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:02,861 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:02,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:03,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:03,065 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:24:03,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash 86844689, now seen corresponding path program 3 times [2025-04-29 11:24:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499253166] [2025-04-29 11:24:03,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:24:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-04-29 11:24:03,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:24:03,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:24:03,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499253166] [2025-04-29 11:24:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499253166] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:03,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992851803] [2025-04-29 11:24:03,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:24:03,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:03,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:03,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:24:03,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-04-29 11:24:03,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:24:03,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:24:03,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-29 11:24:03,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:03,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:24:03,710 INFO L354 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-04-29 11:24:03,732 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:24:03,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:24:03,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:24:03,762 INFO L354 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-04-29 11:24:03,765 INFO L354 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-04-29 11:24:03,877 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:24:03,878 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-04-29 11:24:03,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:24:03,885 INFO L354 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 30 treesize of output 13 [2025-04-29 11:24:03,990 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:24:03,990 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-04-29 11:24:03,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:24:03,999 INFO L354 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 30 treesize of output 13 [2025-04-29 11:24:04,102 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:24:04,102 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-04-29 11:24:04,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:24:04,108 INFO L354 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 30 treesize of output 13 [2025-04-29 11:24:04,193 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:24:04,193 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-04-29 11:24:04,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:24:04,198 INFO L354 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 30 treesize of output 13 [2025-04-29 11:24:04,260 INFO L354 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-04-29 11:24:04,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:24:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:04,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:05,424 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_958))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse6 (store .cse8 .cse7 v_ArrVal_959))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_957) .cse7 v_ArrVal_960)) (.cse0 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse5 (store .cse1 .cse0 v_ArrVal_961))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) (div (+ (- 1) (* (- 1) .cse4)) 4)) (forall ((v_ArrVal_964 (Array Int Int))) (< (+ (mod (+ (* 3 .cse4) 3) 4) .cse4) (+ 8 (select (select (store .cse5 (select (select (store .cse6 .cse0 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))))))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_958))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse14 (store .cse16 .cse15 v_ArrVal_959))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_957) .cse15 v_ArrVal_960)) (.cse9 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse9) (+ (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse11 (store .cse10 .cse9 v_ArrVal_961))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_962))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ 19 .cse3 (select (select (store .cse11 .cse12 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (< (+ .cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) 0)))))))))))) is different from false [2025-04-29 11:24:05,501 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_958))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_959))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_957) .cse9 v_ArrVal_960)) (.cse0 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse0) (+ .cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store .cse2 .cse0 v_ArrVal_961))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_962))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ 19 .cse1 (select (select (store .cse4 .cse5 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (< (+ .cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12) 0)))))))))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_958))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_959))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse15 (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_957) .cse16 v_ArrVal_960))) (or (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_961))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_964 (Array Int Int))) (< (+ (mod (+ (* 3 .cse11) 3) 4) .cse11) (+ 8 (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) (div (+ (- 1) (* (- 1) .cse11)) 4)))))) (< (select |c_#length| .cse14) (+ .cse1 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))))))))))) is different from false [2025-04-29 11:24:05,569 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_958))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_959))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_957) .cse8 v_ArrVal_960)) (.cse0 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse3 (store .cse1 .cse0 v_ArrVal_961))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_962))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ 19 (select (select (store .cse3 .cse4 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (< (+ (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) 0)))))))))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_958))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_959))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse14 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_957) .cse15 v_ArrVal_960))) (or (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_961))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< 2 (div (+ (- 1) (* (- 1) .cse10)) 4)) (forall ((v_ArrVal_964 (Array Int Int))) (< (+ (mod (+ (* 3 .cse10) 3) 4) .cse10) (+ 8 (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (< (select |c_#length| .cse13) (+ (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))))))))))) is different from false [2025-04-29 11:24:05,589 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:05,589 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 540 treesize of output 500 [2025-04-29 11:24:05,596 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:05,596 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 490 treesize of output 310 [2025-04-29 11:24:05,610 INFO L354 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 20429 treesize of output 16415 [2025-04-29 11:24:05,655 INFO L354 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 85654 treesize of output 81730 [2025-04-29 11:24:05,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-04-29 11:24:05,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:24:05,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-04-29 11:24:05,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-04-29 11:24:05,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-04-29 11:24:05,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-04-29 11:24:05,729 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:05,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 533 treesize of output 513 [2025-04-29 11:24:05,735 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:05,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 503 treesize of output 303 [2025-04-29 11:24:05,738 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:05,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13083 treesize of output 9771 [2025-04-29 11:24:05,774 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:05,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2025-04-29 11:24:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2025-04-29 11:24:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992851803] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:05,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 18] total 47 [2025-04-29 11:24:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866238689] [2025-04-29 11:24:05,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:24:05,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:24:05,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1603, Unknown=23, NotChecked=264, Total=2256 [2025-04-29 11:24:05,852 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 48 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:12,075 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:24:12,168 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse28 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse7 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~counter~0#1| 1)) (.cse10 (+ .cse28 .cse7 8)) (.cse9 (select |c_#length| .cse2)) (.cse16 (+ .cse28 .cse7 4))) (and (or (and (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_961))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_964 (Array Int Int))) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8))) (< .cse4 (div (+ (- 1) (* (- 1) .cse0)) 4)))))) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_961))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_962))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse7 15) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (< (+ .cse7 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8) 0))))) (< .cse9 .cse10)) (or (and (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_961))) (or (< (+ .cse7 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 4) 0) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_962))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ (select (select (store .cse11 .cse12 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse7 11) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_961))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< |c_ULTIMATE.start_create_data_~counter~0#1| (div (+ (- 1) (* (- 1) .cse14)) 4)) (forall ((v_ArrVal_964 (Array Int Int))) (< (+ .cse14 (mod (+ (* .cse14 3) 3) 4)) (+ (select (select (store .cse15 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)))))))) (< .cse9 .cse16)) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_959))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_960)) (.cse17 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse17) (+ .cse7 8 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse20 (store .cse18 .cse17 v_ArrVal_961))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_964 (Array Int Int))) (< (+ (mod (+ (* 3 .cse19) 3) 4) .cse19) (+ 8 (select (select (store .cse20 (select (select (store .cse21 .cse17 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< .cse4 (div (+ (- 1) (* (- 1) .cse19)) 4)))))))))) (<= .cse10 .cse9) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_959))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse27 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_960))) (or (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse22 (store .cse27 .cse26 v_ArrVal_961))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse24 (store .cse25 .cse26 v_ArrVal_962))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ .cse7 15 (select (select (store .cse22 .cse23 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse24 .cse23 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (< (+ .cse7 8 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) 0)))) (< (select |c_#length| .cse26) (+ .cse7 8 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse7 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< .cse16 0)) (<= 0 .cse16) (<= (select |c_#length| |c_ULTIMATE.start_create_data_~data~0#1.base|) 8) (or (< |c_ULTIMATE.start_create_data_~counter~0#1| (div (+ (- 1) (* (- 1) .cse28)) 4)) (forall ((v_ArrVal_964 (Array Int Int))) (< (+ .cse28 (mod (+ (* .cse28 3) 3) 4)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)))))))) is different from false [2025-04-29 11:24:12,185 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse9 (+ .cse11 .cse0 4)) (.cse8 (select |c_#length| .cse5)) (.cse10 (+ .cse11 .cse0))) (and (or (and (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_961))) (or (< (+ .cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_962))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ (select (select (store .cse1 .cse3 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 11) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_961))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< |c_ULTIMATE.start_create_data_~counter~0#1| (div (+ (- 1) (* (- 1) .cse6)) 4)) (forall ((v_ArrVal_964 (Array Int Int))) (< (+ .cse6 (mod (+ (* .cse6 3) 3) 4)) (+ (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))))) (< .cse8 .cse9)) (<= 0 .cse10) (<= .cse9 .cse8) (or (< .cse10 0) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_964 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 4))))))))) is different from false [2025-04-29 11:24:12,275 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem4#1.base|)) (.cse0 (+ .cse2 4 |c_ULTIMATE.start_create_data_#t~mem4#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse9 (+ .cse2 |c_ULTIMATE.start_create_data_#t~mem4#1.offset|))) (and (<= .cse0 .cse1) (or (< .cse1 .cse0) (and (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_961))) (or (< (+ .cse2 4 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) 0) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_962))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (< (+ .cse2 (select (select (store .cse3 .cse5 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 11) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_961))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_964 (Array Int Int))) (< (+ (mod (+ (* 3 .cse7) 3) 4) .cse7) (+ (select (select (store .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_962) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 8))) (< |c_ULTIMATE.start_create_data_~counter~0#1| (div (+ (- 1) (* (- 1) .cse7)) 4)))))))) (or (< .cse9 0) (and (forall ((v_ArrVal_964 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 4))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (<= (+ .cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem4#1.base| v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))) (<= 0 .cse9)))) is different from false [2025-04-29 11:24:12,290 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse4 (+ .cse0 .cse1 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= (+ .cse0 .cse1 8) (select |c_#length| .cse2)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< .cse4 0)) (<= 0 .cse4) (or (< |c_ULTIMATE.start_create_data_~counter~0#1| (div (+ (- 1) (* (- 1) .cse0)) 4)) (forall ((v_ArrVal_964 (Array Int Int))) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)))))))) is different from false [2025-04-29 11:24:12,363 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse0 (+ .cse1 .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (<= 0 .cse0) (<= (+ .cse1 .cse2 4) (select |c_#length| .cse3)) (or (< .cse0 0) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_963) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (forall ((v_ArrVal_964 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_964) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 4))))))))) is different from false [2025-04-29 11:24:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:13,094 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2025-04-29 11:24:13,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:24:13,095 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:24:13,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:13,095 INFO L225 Difference]: With dead ends: 202 [2025-04-29 11:24:13,095 INFO L226 Difference]: Without dead ends: 202 [2025-04-29 11:24:13,096 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=760, Invalid=2892, Unknown=40, NotChecked=1000, Total=4692 [2025-04-29 11:24:13,096 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 115 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 16 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 691 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:13,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1082 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 843 Invalid, 17 Unknown, 691 Unchecked, 5.6s Time] [2025-04-29 11:24:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-29 11:24:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2025-04-29 11:24:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.2584269662921348) internal successors, (224), 196 states have internal predecessors, (224), 0 states have call successors, (0), 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-04-29 11:24:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2025-04-29 11:24:13,100 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 34 [2025-04-29 11:24:13,100 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:13,100 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2025-04-29 11:24:13,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:13,101 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2025-04-29 11:24:13,101 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:24:13,101 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:13,101 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] [2025-04-29 11:24:13,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:13,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:13,305 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:24:13,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -231975872, now seen corresponding path program 1 times [2025-04-29 11:24:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:13,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402607555] [2025-04-29 11:24:13,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:13,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:24:13,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:24:13,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:13,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:13,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402607555] [2025-04-29 11:24:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402607555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:13,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:13,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:24:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138136663] [2025-04-29 11:24:13,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:13,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:24:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:13,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:24:13,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:13,743 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:14,439 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2025-04-29 11:24:14,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:24:14,439 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:24:14,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:14,440 INFO L225 Difference]: With dead ends: 219 [2025-04-29 11:24:14,440 INFO L226 Difference]: Without dead ends: 219 [2025-04-29 11:24:14,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:24:14,440 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 122 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:14,440 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 392 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:24:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-29 11:24:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2025-04-29 11:24:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 180 states have (on average 1.2555555555555555) internal successors, (226), 198 states have internal predecessors, (226), 0 states have call successors, (0), 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-04-29 11:24:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 226 transitions. [2025-04-29 11:24:14,443 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 226 transitions. Word has length 34 [2025-04-29 11:24:14,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:14,443 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 226 transitions. [2025-04-29 11:24:14,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:14,444 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 226 transitions. [2025-04-29 11:24:14,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:24:14,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:14,444 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, 1, 1] [2025-04-29 11:24:14,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:24:14,444 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:24:14,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash -190723131, now seen corresponding path program 1 times [2025-04-29 11:24:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:14,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264029521] [2025-04-29 11:24:14,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:14,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:24:14,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:24:14,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:14,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:14,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264029521] [2025-04-29 11:24:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264029521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:14,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:24:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738665541] [2025-04-29 11:24:14,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:14,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:24:14,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:14,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:24:14,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:14,955 INFO L87 Difference]: Start difference. First operand 199 states and 226 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:16,239 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2025-04-29 11:24:16,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:24:16,240 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-29 11:24:16,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:16,241 INFO L225 Difference]: With dead ends: 284 [2025-04-29 11:24:16,241 INFO L226 Difference]: Without dead ends: 284 [2025-04-29 11:24:16,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:24:16,241 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 118 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:16,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 462 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 11:24:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-29 11:24:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 197. [2025-04-29 11:24:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.2584269662921348) internal successors, (224), 196 states have internal predecessors, (224), 0 states have call successors, (0), 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-04-29 11:24:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2025-04-29 11:24:16,245 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 37 [2025-04-29 11:24:16,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:16,245 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2025-04-29 11:24:16,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,245 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2025-04-29 11:24:16,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:24:16,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:16,246 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:16,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:24:16,247 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:24:16,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:16,247 INFO L85 PathProgramCache]: Analyzing trace with hash -762778106, now seen corresponding path program 1 times [2025-04-29 11:24:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:16,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327278918] [2025-04-29 11:24:16,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:16,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:24:16,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:24:16,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:16,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:16,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327278918] [2025-04-29 11:24:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327278918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:24:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17881731] [2025-04-29 11:24:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:16,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:24:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:24:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:16,644 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:17,331 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2025-04-29 11:24:17,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:24:17,331 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:24:17,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:17,332 INFO L225 Difference]: With dead ends: 225 [2025-04-29 11:24:17,332 INFO L226 Difference]: Without dead ends: 222 [2025-04-29 11:24:17,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:24:17,332 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:17,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 667 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:24:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-04-29 11:24:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 197. [2025-04-29 11:24:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.247191011235955) internal successors, (222), 196 states have internal predecessors, (222), 0 states have call successors, (0), 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-04-29 11:24:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions. [2025-04-29 11:24:17,335 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 38 [2025-04-29 11:24:17,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:17,335 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions. [2025-04-29 11:24:17,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:17,335 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions. [2025-04-29 11:24:17,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:24:17,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:17,336 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:17,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:24:17,336 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:24:17,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1563712494, now seen corresponding path program 1 times [2025-04-29 11:24:17,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:17,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121226638] [2025-04-29 11:24:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:17,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:24:17,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:24:17,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:17,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:18,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121226638] [2025-04-29 11:24:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121226638] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:18,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234849397] [2025-04-29 11:24:18,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:18,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:18,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:18,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:24:18,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:24:18,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:24:18,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:18,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-29 11:24:18,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:19,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:24:19,865 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-29 11:24:19,865 INFO L354 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 1 case distinctions, treesize of input 23 treesize of output 15 [2025-04-29 11:24:21,764 INFO L325 Elim1Store]: treesize reduction 48, result has 56.0 percent of original size [2025-04-29 11:24:21,765 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 338 treesize of output 274 Killed by 15