./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:07:50,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:07:50,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:07:50,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:07:50,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:07:50,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:07:50,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:07:50,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:07:50,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:07:50,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:07:50,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:07:50,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:07:50,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:07:50,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:07:50,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:07:50,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:50,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:07:50,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:50,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:07:50,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:07:50,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 [2025-01-09 16:07:51,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:07:51,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:07:51,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:07:51,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:07:51,191 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:07:51,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2025-01-09 16:07:52,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7641cb3a3/a66ed9ece83547158958287c56c94832/FLAG97b05df8e [2025-01-09 16:07:52,858 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:07:52,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2025-01-09 16:07:52,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7641cb3a3/a66ed9ece83547158958287c56c94832/FLAG97b05df8e [2025-01-09 16:07:53,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7641cb3a3/a66ed9ece83547158958287c56c94832 [2025-01-09 16:07:53,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:07:53,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:07:53,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:07:53,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:07:53,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:07:53,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c8be21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53, skipping insertion in model container [2025-01-09 16:07:53,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:07:53,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2025-01-09 16:07:53,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:07:53,229 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:07:53,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2025-01-09 16:07:53,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:07:53,268 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:07:53,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53 WrapperNode [2025-01-09 16:07:53,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:07:53,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:07:53,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:07:53,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:07:53,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,313 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-01-09 16:07:53,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:07:53,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:07:53,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:07:53,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:07:53,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,327 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:07:53,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:07:53,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:07:53,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:07:53,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:07:53,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (1/1) ... [2025-01-09 16:07:53,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:53,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:07:53,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:07:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:07:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:07:53,489 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:07:53,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:07:53,914 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-01-09 16:07:53,915 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:07:53,929 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:07:53,932 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:07:53,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:53 BoogieIcfgContainer [2025-01-09 16:07:53,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:07:53,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:07:53,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:07:53,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:07:53,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:07:53" (1/3) ... [2025-01-09 16:07:53,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de327b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:07:53, skipping insertion in model container [2025-01-09 16:07:53,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:53" (2/3) ... [2025-01-09 16:07:53,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de327b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:07:53, skipping insertion in model container [2025-01-09 16:07:53,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:53" (3/3) ... [2025-01-09 16:07:53,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-22.i [2025-01-09 16:07:53,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:07:53,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-22.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:07:53,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:07:53,994 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6d5685c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:07:53,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:07:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:07:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 16:07:54,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:54,004 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:54,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1986612302, now seen corresponding path program 1 times [2025-01-09 16:07:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500213188] [2025-01-09 16:07:54,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:54,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 16:07:54,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 16:07:54,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:54,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 16:07:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500213188] [2025-01-09 16:07:54,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500213188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:07:54,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074416182] [2025-01-09 16:07:54,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:54,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:07:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:54,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:07:54,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:07:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 16:07:54,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 16:07:54,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:54,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:54,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:07:54,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:07:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 16:07:54,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:07:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074416182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:07:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:07:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719119936] [2025-01-09 16:07:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:54,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:07:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:07:54,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:07:54,567 INFO L87 Difference]: Start difference. First operand has 104 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:07:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:54,585 INFO L93 Difference]: Finished difference Result 202 states and 308 transitions. [2025-01-09 16:07:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:07:54,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-01-09 16:07:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:54,591 INFO L225 Difference]: With dead ends: 202 [2025-01-09 16:07:54,591 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 16:07:54,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:07:54,596 INFO L435 NwaCegarLoop]: 146 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, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:54,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:07:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 16:07:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 16:07:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:07:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2025-01-09 16:07:54,627 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2025-01-09 16:07:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:54,629 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2025-01-09 16:07:54,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:07:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2025-01-09 16:07:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 16:07:54,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:54,631 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:54,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:07:54,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:07:54,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash -319970096, now seen corresponding path program 1 times [2025-01-09 16:07:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489489329] [2025-01-09 16:07:54,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 16:07:54,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 16:07:54,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:54,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:07:56,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:56,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489489329] [2025-01-09 16:07:56,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489489329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:56,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:56,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:07:56,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660710394] [2025-01-09 16:07:56,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:56,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:07:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:07:56,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:56,695 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:07:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:57,479 INFO L93 Difference]: Finished difference Result 368 states and 537 transitions. [2025-01-09 16:07:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:07:57,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-01-09 16:07:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:57,482 INFO L225 Difference]: With dead ends: 368 [2025-01-09 16:07:57,482 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 16:07:57,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:07:57,483 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 442 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:57,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 408 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:07:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 16:07:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 148. [2025-01-09 16:07:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:07:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2025-01-09 16:07:57,521 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 90 [2025-01-09 16:07:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:57,522 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2025-01-09 16:07:57,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:07:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2025-01-09 16:07:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 16:07:57,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:57,524 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:07:57,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -605346413, now seen corresponding path program 1 times [2025-01-09 16:07:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318679023] [2025-01-09 16:07:57,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:57,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 16:07:57,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 16:07:57,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:57,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:07:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318679023] [2025-01-09 16:07:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318679023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:07:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466027056] [2025-01-09 16:07:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:57,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:07:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:57,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:07:57,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:07:57,968 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:07:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:58,174 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2025-01-09 16:07:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:07:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-01-09 16:07:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:58,177 INFO L225 Difference]: With dead ends: 328 [2025-01-09 16:07:58,178 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 16:07:58,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:07:58,179 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 282 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:58,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 445 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:07:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 16:07:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2025-01-09 16:07:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.390625) internal successors, (178), 128 states have internal predecessors, (178), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:07:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 214 transitions. [2025-01-09 16:07:58,195 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 214 transitions. Word has length 91 [2025-01-09 16:07:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:58,196 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 214 transitions. [2025-01-09 16:07:58,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:07:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 214 transitions. [2025-01-09 16:07:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 16:07:58,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:58,197 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:58,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:07:58,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:58,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash -987725709, now seen corresponding path program 1 times [2025-01-09 16:07:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192638508] [2025-01-09 16:07:58,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:58,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 16:07:58,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 16:07:58,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:58,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:07:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:58,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192638508] [2025-01-09 16:07:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192638508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:58,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:07:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418147517] [2025-01-09 16:07:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:58,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:07:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:58,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:07:58,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:07:58,283 INFO L87 Difference]: Start difference. First operand 149 states and 214 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:07:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:58,352 INFO L93 Difference]: Finished difference Result 246 states and 355 transitions. [2025-01-09 16:07:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:07:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-01-09 16:07:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:58,354 INFO L225 Difference]: With dead ends: 246 [2025-01-09 16:07:58,354 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 16:07:58,355 INFO L434 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-01-09 16:07:58,355 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:07:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 16:07:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-01-09 16:07:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 127 states have internal predecessors, (175), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:07:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 211 transitions. [2025-01-09 16:07:58,378 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 211 transitions. Word has length 92 [2025-01-09 16:07:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 211 transitions. [2025-01-09 16:07:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:07:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 211 transitions. [2025-01-09 16:07:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 16:07:58,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:58,380 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:58,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:07:58,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:58,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash -430930682, now seen corresponding path program 1 times [2025-01-09 16:07:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760012206] [2025-01-09 16:07:58,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:58,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 16:07:58,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 16:07:58,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:58,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 16:07:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760012206] [2025-01-09 16:07:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760012206] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:07:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708014404] [2025-01-09 16:07:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:07:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:59,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:07:59,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:07:59,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 16:07:59,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 16:07:59,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:59,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:59,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 16:07:59,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:07:59,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2025-01-09 16:08:00,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 94 [2025-01-09 16:08:01,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 16:08:01,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2025-01-09 16:08:01,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 16:08:01,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:01,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 16:08:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 16:08:01,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:08:01,980 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_511 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_511))) (let ((.cse2 (mod (+ (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (not (= v_ArrVal_511 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_511 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) .cse2) (< 32767 .cse2))))) (forall ((v_ArrVal_511 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_511))) (let ((.cse3 (mod (+ (select (select .cse4 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (not (= v_ArrVal_511 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_511 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (< .cse3 32768) (not (= (select (select .cse4 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) .cse3)))))) (forall ((v_ArrVal_511 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_511))) (let ((.cse6 (mod (+ (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536)) (.cse5 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (not (= v_ArrVal_511 (store .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_511 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= .cse5 .cse6) (= .cse6 (+ 65536 .cse5)))))))) is different from false [2025-01-09 16:08:02,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_509)))) (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_511))) (let ((.cse0 (mod (+ (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (< .cse0 32768) (not (= .cse0 (select (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (not (= v_ArrVal_511 (store (select .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_511 c_~WrapperStruct00_var_1_7_Pointer~0.offset))))))))) (forall ((v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_509)))) (let ((.cse7 (store .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_511))) (let ((.cse4 (mod (+ (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536)) (.cse5 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (= .cse4 (+ 65536 .cse5)) (not (= v_ArrVal_511 (store (select .cse6 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_511 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= .cse4 .cse5)))))) (forall ((v_ArrVal_509 Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_509)))) (let ((.cse10 (store .cse9 c_~WrapperStruct00_var_1_7_Pointer~0.base v_ArrVal_511))) (let ((.cse8 (mod (+ (select (select .cse10 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 65520) 65536))) (or (< 32767 .cse8) (not (= v_ArrVal_511 (store (select .cse9 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset (select v_ArrVal_511 c_~WrapperStruct00_var_1_7_Pointer~0.offset)))) (= .cse8 (select (select .cse10 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))))))))) is different from false [2025-01-09 16:08:02,923 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:02,994 INFO L349 Elim1Store]: treesize reduction 67, result has 42.2 percent of original size [2025-01-09 16:08:02,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 304 treesize of output 96 [2025-01-09 16:08:03,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:03,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 175 [2025-01-09 16:08:03,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2025-01-09 16:08:03,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:03,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 121 [2025-01-09 16:08:03,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:03,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 309 [2025-01-09 16:08:03,973 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:04,025 INFO L349 Elim1Store]: treesize reduction 58, result has 50.0 percent of original size [2025-01-09 16:08:04,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 303 treesize of output 104 [2025-01-09 16:08:04,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:04,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 179 [2025-01-09 16:08:04,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2025-01-09 16:08:04,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-01-09 16:08:04,782 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:08:04,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2025-01-09 16:08:05,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:05,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1155 treesize of output 1017 [2025-01-09 16:08:05,606 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:05,654 INFO L349 Elim1Store]: treesize reduction 87, result has 25.0 percent of original size [2025-01-09 16:08:05,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 376 treesize of output 84 [2025-01-09 16:08:05,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:05,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 182 [2025-01-09 16:08:05,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 16:08:05,770 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:05,827 INFO L349 Elim1Store]: treesize reduction 60, result has 50.0 percent of original size [2025-01-09 16:08:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 396 treesize of output 115 [2025-01-09 16:08:05,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:05,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 235 [2025-01-09 16:08:05,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2025-01-09 16:08:06,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,766 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 16:08:06,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,771 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 16:08:06,774 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,775 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,777 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 16:08:06,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:06,785 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 16:08:06,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:06,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 416 treesize of output 386 [2025-01-09 16:08:06,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:06,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1436 treesize of output 1264 [2025-01-09 16:08:07,565 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:07,578 INFO L349 Elim1Store]: treesize reduction 119, result has 0.8 percent of original size [2025-01-09 16:08:07,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 320 treesize of output 1 [2025-01-09 16:08:07,585 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:08:07,599 INFO L349 Elim1Store]: treesize reduction 119, result has 0.8 percent of original size [2025-01-09 16:08:07,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 1 [2025-01-09 16:08:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708014404] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:08:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 11] total 29 [2025-01-09 16:08:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982928181] [2025-01-09 16:08:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:08:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:08,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:08:08,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2025-01-09 16:08:08,320 INFO L87 Difference]: Start difference. First operand 148 states and 211 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:09,133 INFO L93 Difference]: Finished difference Result 302 states and 430 transitions. [2025-01-09 16:08:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:09,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2025-01-09 16:08:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:09,134 INFO L225 Difference]: With dead ends: 302 [2025-01-09 16:08:09,134 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 16:08:09,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=104, Invalid=771, Unknown=3, NotChecked=114, Total=992 [2025-01-09 16:08:09,135 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 216 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:09,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 476 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 425 Unchecked, 0.2s Time] [2025-01-09 16:08:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 16:08:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2025-01-09 16:08:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 147 states have internal predecessors, (202), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 238 transitions. [2025-01-09 16:08:09,155 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 238 transitions. Word has length 95 [2025-01-09 16:08:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:09,155 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 238 transitions. [2025-01-09 16:08:09,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 238 transitions. [2025-01-09 16:08:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:08:09,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:09,157 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:09,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:09,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:09,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1735535041, now seen corresponding path program 1 times [2025-01-09 16:08:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474806682] [2025-01-09 16:08:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:08:09,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:08:09,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:09,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474806682] [2025-01-09 16:08:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474806682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:09,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:09,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:08:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354291868] [2025-01-09 16:08:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:09,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:08:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:09,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:08:09,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:09,911 INFO L87 Difference]: Start difference. First operand 168 states and 238 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:10,110 INFO L93 Difference]: Finished difference Result 355 states and 506 transitions. [2025-01-09 16:08:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:10,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 16:08:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:10,112 INFO L225 Difference]: With dead ends: 355 [2025-01-09 16:08:10,112 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 16:08:10,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:10,113 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:10,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 516 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:08:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 16:08:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 164. [2025-01-09 16:08:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3706293706293706) internal successors, (196), 143 states have internal predecessors, (196), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 232 transitions. [2025-01-09 16:08:10,128 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 232 transitions. Word has length 96 [2025-01-09 16:08:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:10,129 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 232 transitions. [2025-01-09 16:08:10,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 232 transitions. [2025-01-09 16:08:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 16:08:10,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:10,129 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:10,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:08:10,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:10,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1109431455, now seen corresponding path program 1 times [2025-01-09 16:08:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771449993] [2025-01-09 16:08:10,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:10,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 16:08:10,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 16:08:10,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771449993] [2025-01-09 16:08:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771449993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:08:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521494186] [2025-01-09 16:08:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:11,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:08:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:11,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:08:11,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:11,129 INFO L87 Difference]: Start difference. First operand 164 states and 232 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:11,712 INFO L93 Difference]: Finished difference Result 404 states and 573 transitions. [2025-01-09 16:08:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:08:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-01-09 16:08:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:11,715 INFO L225 Difference]: With dead ends: 404 [2025-01-09 16:08:11,716 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 16:08:11,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:08:11,718 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 399 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:11,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 785 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:08:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 16:08:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 186. [2025-01-09 16:08:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.3696969696969696) internal successors, (226), 165 states have internal predecessors, (226), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2025-01-09 16:08:11,731 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 97 [2025-01-09 16:08:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:11,731 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2025-01-09 16:08:11,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2025-01-09 16:08:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 16:08:11,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:11,734 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:11,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:08:11,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash -216772180, now seen corresponding path program 1 times [2025-01-09 16:08:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696304805] [2025-01-09 16:08:11,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:11,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 16:08:11,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 16:08:11,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:11,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696304805] [2025-01-09 16:08:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696304805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157235706] [2025-01-09 16:08:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:11,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:11,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:11,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:11,898 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:11,911 INFO L93 Difference]: Finished difference Result 302 states and 428 transitions. [2025-01-09 16:08:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-01-09 16:08:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:11,914 INFO L225 Difference]: With dead ends: 302 [2025-01-09 16:08:11,914 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 16:08:11,915 INFO L434 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-01-09 16:08:11,916 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:11,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 16:08:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 16:08:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 159 states have internal predecessors, (214), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 250 transitions. [2025-01-09 16:08:11,930 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 250 transitions. Word has length 97 [2025-01-09 16:08:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 250 transitions. [2025-01-09 16:08:11,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 250 transitions. [2025-01-09 16:08:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 16:08:11,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:11,933 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:11,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:08:11,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:11,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash -380628320, now seen corresponding path program 1 times [2025-01-09 16:08:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215540477] [2025-01-09 16:08:11,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:11,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 16:08:11,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 16:08:11,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:11,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:12,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215540477] [2025-01-09 16:08:12,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215540477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:12,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:12,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:08:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975187885] [2025-01-09 16:08:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:12,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:08:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:12,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:08:12,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:08:12,252 INFO L87 Difference]: Start difference. First operand 180 states and 250 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:12,734 INFO L93 Difference]: Finished difference Result 387 states and 544 transitions. [2025-01-09 16:08:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:08:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-01-09 16:08:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:12,736 INFO L225 Difference]: With dead ends: 387 [2025-01-09 16:08:12,736 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 16:08:12,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:12,737 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 164 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:12,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 441 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:08:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 16:08:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 191. [2025-01-09 16:08:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 170 states have internal predecessors, (228), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 264 transitions. [2025-01-09 16:08:12,745 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 264 transitions. Word has length 97 [2025-01-09 16:08:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:12,745 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 264 transitions. [2025-01-09 16:08:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 264 transitions. [2025-01-09 16:08:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 16:08:12,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:12,746 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:12,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:08:12,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:12,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash -318588706, now seen corresponding path program 1 times [2025-01-09 16:08:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018834180] [2025-01-09 16:08:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:12,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 16:08:12,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 16:08:12,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:12,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018834180] [2025-01-09 16:08:13,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018834180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:13,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:13,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:08:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922915885] [2025-01-09 16:08:13,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:13,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:08:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:13,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:08:13,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:13,253 INFO L87 Difference]: Start difference. First operand 191 states and 264 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:13,577 INFO L93 Difference]: Finished difference Result 320 states and 447 transitions. [2025-01-09 16:08:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:13,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2025-01-09 16:08:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:13,580 INFO L225 Difference]: With dead ends: 320 [2025-01-09 16:08:13,581 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 16:08:13,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:08:13,581 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 277 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:13,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 408 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 16:08:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2025-01-09 16:08:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2025-01-09 16:08:13,595 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 97 [2025-01-09 16:08:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:13,595 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2025-01-09 16:08:13,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2025-01-09 16:08:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 16:08:13,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:13,596 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:08:13,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:13,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash -99733988, now seen corresponding path program 1 times [2025-01-09 16:08:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924675008] [2025-01-09 16:08:13,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:13,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 16:08:13,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 16:08:13,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924675008] [2025-01-09 16:08:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924675008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:08:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277129979] [2025-01-09 16:08:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:08:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:14,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:08:14,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:14,329 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:15,279 INFO L93 Difference]: Finished difference Result 386 states and 536 transitions. [2025-01-09 16:08:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:08:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2025-01-09 16:08:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:15,281 INFO L225 Difference]: With dead ends: 386 [2025-01-09 16:08:15,281 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 16:08:15,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:08:15,282 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 264 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:15,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 636 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:08:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 16:08:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 202. [2025-01-09 16:08:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 181 states have internal predecessors, (241), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 277 transitions. [2025-01-09 16:08:15,292 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 277 transitions. Word has length 97 [2025-01-09 16:08:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 277 transitions. [2025-01-09 16:08:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2025-01-09 16:08:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 16:08:15,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:15,293 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:15,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:08:15,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2093878694, now seen corresponding path program 1 times [2025-01-09 16:08:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785930456] [2025-01-09 16:08:15,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 16:08:15,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 16:08:15,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:15,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:16,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:16,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785930456] [2025-01-09 16:08:16,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785930456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:16,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:16,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:08:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448882472] [2025-01-09 16:08:16,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:16,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:08:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:16,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:08:16,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:08:16,234 INFO L87 Difference]: Start difference. First operand 202 states and 277 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:16,965 INFO L93 Difference]: Finished difference Result 388 states and 538 transitions. [2025-01-09 16:08:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:08:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2025-01-09 16:08:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:16,966 INFO L225 Difference]: With dead ends: 388 [2025-01-09 16:08:16,966 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 16:08:16,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:08:16,967 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 250 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:16,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 534 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:08:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 16:08:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 200. [2025-01-09 16:08:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.329608938547486) internal successors, (238), 179 states have internal predecessors, (238), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 274 transitions. [2025-01-09 16:08:16,978 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 274 transitions. Word has length 97 [2025-01-09 16:08:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 274 transitions. [2025-01-09 16:08:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 274 transitions. [2025-01-09 16:08:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:08:16,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:16,979 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:16,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:08:16,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash -201142105, now seen corresponding path program 1 times [2025-01-09 16:08:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297288010] [2025-01-09 16:08:16,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:17,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:08:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:08:17,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:17,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:17,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:17,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297288010] [2025-01-09 16:08:17,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297288010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:17,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91534864] [2025-01-09 16:08:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:17,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:17,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:17,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:17,114 INFO L87 Difference]: Start difference. First operand 200 states and 274 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:17,128 INFO L93 Difference]: Finished difference Result 296 states and 410 transitions. [2025-01-09 16:08:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-01-09 16:08:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:17,131 INFO L225 Difference]: With dead ends: 296 [2025-01-09 16:08:17,131 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 16:08:17,131 INFO L434 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-01-09 16:08:17,133 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:17,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 16:08:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2025-01-09 16:08:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 148 states have internal predecessors, (195), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 231 transitions. [2025-01-09 16:08:17,149 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 231 transitions. Word has length 98 [2025-01-09 16:08:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:17,149 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 231 transitions. [2025-01-09 16:08:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:08:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 231 transitions. [2025-01-09 16:08:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:08:17,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:17,150 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:17,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:08:17,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash 781119176, now seen corresponding path program 1 times [2025-01-09 16:08:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357469438] [2025-01-09 16:08:17,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:17,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:08:17,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:08:17,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:17,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:08:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:18,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357469438] [2025-01-09 16:08:18,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357469438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:18,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:18,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:08:18,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275625288] [2025-01-09 16:08:18,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:18,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:08:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:18,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:08:18,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:08:18,079 INFO L87 Difference]: Start difference. First operand 169 states and 231 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:18,440 INFO L93 Difference]: Finished difference Result 315 states and 433 transitions. [2025-01-09 16:08:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 98 [2025-01-09 16:08:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:18,444 INFO L225 Difference]: With dead ends: 315 [2025-01-09 16:08:18,444 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 16:08:18,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:18,444 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 380 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:18,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 465 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 16:08:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 189. [2025-01-09 16:08:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 168 states have internal predecessors, (221), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:08:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2025-01-09 16:08:18,455 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 98 [2025-01-09 16:08:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:18,455 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2025-01-09 16:08:18,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:08:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2025-01-09 16:08:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 16:08:18,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:18,455 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:18,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:08:18,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:18,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1602457276, now seen corresponding path program 1 times [2025-01-09 16:08:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774226305] [2025-01-09 16:08:18,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:18,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 16:08:18,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 16:08:18,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:18,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 16:08:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774226305] [2025-01-09 16:08:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774226305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175754052] [2025-01-09 16:08:19,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:19,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:08:19,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:08:19,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 16:08:19,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 16:08:19,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:19,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:19,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 16:08:19,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:19,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 16:08:20,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:08:20,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-01-09 16:08:20,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2025-01-09 16:08:20,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,997 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2025-01-09 16:08:20,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 85 [2025-01-09 16:08:21,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,136 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-09 16:08:21,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2025-01-09 16:08:22,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:22,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 250 treesize of output 510