./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.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-s_file-69.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 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:01:52,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:01:52,426 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:01:52,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:01:52,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:01:52,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:01:52,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:01:52,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:01:52,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:01:52,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:01:52,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:01:52,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:01:52,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:01:52,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:01:52,452 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:01:52,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:01:52,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:01:52,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:01:52,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:01:52,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:01:52,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:01:52,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:52,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:52,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:52,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:01:52,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:01:52,455 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 -> 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 [2025-01-09 16:01:52,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:01:52,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:01:52,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:01:52,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:01:52,704 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:01:52,704 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-s_file-69.i [2025-01-09 16:01:53,957 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a5634964/0823ee25f03347bd96f634469d7d4025/FLAG1cd04ea7f [2025-01-09 16:01:54,217 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:01:54,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2025-01-09 16:01:54,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a5634964/0823ee25f03347bd96f634469d7d4025/FLAG1cd04ea7f [2025-01-09 16:01:54,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a5634964/0823ee25f03347bd96f634469d7d4025 [2025-01-09 16:01:54,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:01:54,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:01:54,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:54,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:01:54,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:01:54,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54, skipping insertion in model container [2025-01-09 16:01:54,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:01:54,630 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-s_file-69.i[916,929] [2025-01-09 16:01:54,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:54,670 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:01:54,677 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-s_file-69.i[916,929] [2025-01-09 16:01:54,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:54,711 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:01:54,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54 WrapperNode [2025-01-09 16:01:54,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:54,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:54,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:01:54,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:01:54,717 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:01:54" (1/1) ... [2025-01-09 16:01:54,724 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:01:54" (1/1) ... [2025-01-09 16:01:54,756 INFO L138 Inliner]: procedures = 30, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2025-01-09 16:01:54,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:54,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:01:54,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:01:54,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:01:54,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,782 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:01:54,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:01:54,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:01:54,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:01:54,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:01:54,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (1/1) ... [2025-01-09 16:01:54,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:54,848 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:01:54,850 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:01:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:01:54,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:01:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:01:54,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:01:54,943 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:01:54,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:01:55,233 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-01-09 16:01:55,234 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:01:55,240 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:01:55,240 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:01:55,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:55 BoogieIcfgContainer [2025-01-09 16:01:55,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:01:55,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:01:55,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:01:55,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:01:55,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:54" (1/3) ... [2025-01-09 16:01:55,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f74db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:55, skipping insertion in model container [2025-01-09 16:01:55,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:54" (2/3) ... [2025-01-09 16:01:55,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f74db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:55, skipping insertion in model container [2025-01-09 16:01:55,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:55" (3/3) ... [2025-01-09 16:01:55,247 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-69.i [2025-01-09 16:01:55,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:01:55,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-69.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:01:55,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:01:55,292 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;@5685688f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:01:55,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:01:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:01:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:01:55,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:55,301 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:55,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1485235830, now seen corresponding path program 1 times [2025-01-09 16:01:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:55,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702355791] [2025-01-09 16:01:55,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:01:55,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:01:55,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:55,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 16:01:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702355791] [2025-01-09 16:01:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702355791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32538532] [2025-01-09 16:01:55,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:55,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:55,598 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:01:55,599 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:01:55,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:01:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:01:55,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:55,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:01:55,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 16:01:55,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32538532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:55,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:01:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792760267] [2025-01-09 16:01:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:55,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:01:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:55,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:01:55,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:01:55,798 INFO L87 Difference]: Start difference. First operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:01:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:55,813 INFO L93 Difference]: Finished difference Result 180 states and 284 transitions. [2025-01-09 16:01:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:01:55,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-01-09 16:01:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:55,819 INFO L225 Difference]: With dead ends: 180 [2025-01-09 16:01:55,819 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 16:01:55,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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:01:55,822 INFO L435 NwaCegarLoop]: 132 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, 132 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:01:55,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 16:01:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 16:01:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:01:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-01-09 16:01:55,846 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2025-01-09 16:01:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-01-09 16:01:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:01:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-01-09 16:01:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:01:55,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:55,849 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:55,856 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:01:56,050 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:01:56,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1909242788, now seen corresponding path program 1 times [2025-01-09 16:01:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144285459] [2025-01-09 16:01:56,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:56,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:01:56,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:01:56,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:56,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 16:01:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:56,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144285459] [2025-01-09 16:01:56,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144285459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:56,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265477856] [2025-01-09 16:01:56,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:56,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:56,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:56,477 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:01:56,478 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:01:56,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:01:56,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:01:56,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:56,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:56,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:01:56,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:01:56,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:56,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265477856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:56,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:56,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:01:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257714154] [2025-01-09 16:01:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:56,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:56,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:56,670 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:01:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:56,695 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2025-01-09 16:01:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:56,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-01-09 16:01:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:56,697 INFO L225 Difference]: With dead ends: 179 [2025-01-09 16:01:56,697 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 16:01:56,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:56,698 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:56,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 16:01:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 16:01:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:01:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-01-09 16:01:56,728 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2025-01-09 16:01:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:56,729 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-01-09 16:01:56,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:01:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-01-09 16:01:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:01:56,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:56,730 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:56,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:01:56,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:56,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:56,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 158611253, now seen corresponding path program 1 times [2025-01-09 16:01:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:56,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791389726] [2025-01-09 16:01:56,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:56,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:01:57,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:01:57,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:57,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:01:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791389726] [2025-01-09 16:01:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791389726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:01:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136530186] [2025-01-09 16:01:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:57,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:01:57,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:57,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:01:57,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:57,667 INFO L87 Difference]: Start difference. First operand 92 states and 134 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:01:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:58,059 INFO L93 Difference]: Finished difference Result 231 states and 335 transitions. [2025-01-09 16:01:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:01:58,060 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-01-09 16:01:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:58,061 INFO L225 Difference]: With dead ends: 231 [2025-01-09 16:01:58,063 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 16:01:58,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:58,064 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 56 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:58,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 399 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:01:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 16:01:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-01-09 16:01:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.403361344537815) internal successors, (167), 120 states have internal predecessors, (167), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:01:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2025-01-09 16:01:58,084 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 121 [2025-01-09 16:01:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:58,084 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2025-01-09 16:01:58,084 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:01:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2025-01-09 16:01:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:01:58,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:58,086 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:01:58,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:58,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -428194761, now seen corresponding path program 1 times [2025-01-09 16:01:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494231997] [2025-01-09 16:01:58,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:58,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:01:58,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:01:58,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:58,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:01:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113849422] [2025-01-09 16:01:58,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:58,209 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:01:58,210 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:01:58,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:01:58,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:01:58,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:58,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:58,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 16:01:58,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:58,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:01:58,690 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 19 treesize of output 19 [2025-01-09 16:01:58,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:01:58,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 58 [2025-01-09 16:01:58,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:01:58,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 22 [2025-01-09 16:01:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:01:58,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494231997] [2025-01-09 16:01:58,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:01:58,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113849422] [2025-01-09 16:01:58,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113849422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:58,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:58,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:01:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126724513] [2025-01-09 16:01:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:58,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:01:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:58,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:01:58,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:01:58,908 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:01:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:59,778 INFO L93 Difference]: Finished difference Result 421 states and 606 transitions. [2025-01-09 16:01:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:01:59,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-01-09 16:01:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:59,781 INFO L225 Difference]: With dead ends: 421 [2025-01-09 16:01:59,781 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 16:01:59,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:01:59,785 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:59,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 480 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:01:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 16:01:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 255. [2025-01-09 16:01:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 223 states have (on average 1.4080717488789238) internal successors, (314), 226 states have internal predecessors, (314), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:01:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 368 transitions. [2025-01-09 16:01:59,804 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 368 transitions. Word has length 121 [2025-01-09 16:01:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:59,807 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 368 transitions. [2025-01-09 16:01:59,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:01:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 368 transitions. [2025-01-09 16:01:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:01:59,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:59,809 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:59,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:02:00,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:02:00,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:00,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1847554995, now seen corresponding path program 1 times [2025-01-09 16:02:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:00,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138774491] [2025-01-09 16:02:00,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:00,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:02:00,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:02:00,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:00,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:02:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321343444] [2025-01-09 16:02:00,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:00,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:02:00,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:02:00,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:02:00,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:02:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:02:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:02:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:00,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 16:02:00,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:00,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:00,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:00,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:00,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:00,485 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 19 treesize of output 19 [2025-01-09 16:02:00,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:00,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 58 [2025-01-09 16:02:00,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:00,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 22 [2025-01-09 16:02:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:00,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138774491] [2025-01-09 16:02:00,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:02:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321343444] [2025-01-09 16:02:00,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321343444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:00,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:00,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:02:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770133818] [2025-01-09 16:02:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:00,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:02:00,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:00,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:02:00,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:02:00,713 INFO L87 Difference]: Start difference. First operand 255 states and 368 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:01,541 INFO L93 Difference]: Finished difference Result 551 states and 794 transitions. [2025-01-09 16:02:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:02:01,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-01-09 16:02:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:01,543 INFO L225 Difference]: With dead ends: 551 [2025-01-09 16:02:01,543 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 16:02:01,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:02:01,544 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 152 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:01,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 408 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:02:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 16:02:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 263. [2025-01-09 16:02:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 231 states have (on average 1.4112554112554112) internal successors, (326), 234 states have internal predecessors, (326), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:02:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 380 transitions. [2025-01-09 16:02:01,555 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 380 transitions. Word has length 121 [2025-01-09 16:02:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:01,556 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 380 transitions. [2025-01-09 16:02:01,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 380 transitions. [2025-01-09 16:02:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:02:01,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:01,557 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:01,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:02:01,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:02:01,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:01,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1260748981, now seen corresponding path program 1 times [2025-01-09 16:02:01,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:01,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954524139] [2025-01-09 16:02:01,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:01,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:01,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:02:01,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:02:01,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:01,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954524139] [2025-01-09 16:02:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954524139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:02:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405481032] [2025-01-09 16:02:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:02:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:02,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:02:02,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:02:02,162 INFO L87 Difference]: Start difference. First operand 263 states and 380 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:02,646 INFO L93 Difference]: Finished difference Result 649 states and 928 transitions. [2025-01-09 16:02:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:02:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-01-09 16:02:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:02,651 INFO L225 Difference]: With dead ends: 649 [2025-01-09 16:02:02,651 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 16:02:02,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:02,652 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 131 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:02,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 450 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:02:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 16:02:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 193. [2025-01-09 16:02:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.387878787878788) internal successors, (229), 166 states have internal predecessors, (229), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2025-01-09 16:02:02,679 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 121 [2025-01-09 16:02:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:02,681 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2025-01-09 16:02:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2025-01-09 16:02:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:02:02,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:02,682 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:02,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:02:02,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:02,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1438003267, now seen corresponding path program 1 times [2025-01-09 16:02:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206642330] [2025-01-09 16:02:02,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:02,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:02:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:02:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:02,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206642330] [2025-01-09 16:02:03,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206642330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:03,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:02:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336572023] [2025-01-09 16:02:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:03,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:03,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:03,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:03,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:03,038 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:03,338 INFO L93 Difference]: Finished difference Result 525 states and 746 transitions. [2025-01-09 16:02:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:02:03,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-01-09 16:02:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:03,341 INFO L225 Difference]: With dead ends: 525 [2025-01-09 16:02:03,341 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 16:02:03,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:03,343 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 99 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:03,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 777 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:02:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 16:02:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 207. [2025-01-09 16:02:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 179 states have (on average 1.3966480446927374) internal successors, (250), 180 states have internal predecessors, (250), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2025-01-09 16:02:03,363 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 122 [2025-01-09 16:02:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:03,363 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2025-01-09 16:02:03,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2025-01-09 16:02:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:02:03,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:03,365 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:03,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:02:03,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:03,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:03,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1003897730, now seen corresponding path program 1 times [2025-01-09 16:02:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:03,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081981994] [2025-01-09 16:02:03,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:03,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:03,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:02:03,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:02:03,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:03,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081981994] [2025-01-09 16:02:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081981994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:02:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664781931] [2025-01-09 16:02:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:03,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:03,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:03,632 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:03,876 INFO L93 Difference]: Finished difference Result 417 states and 595 transitions. [2025-01-09 16:02:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:02:03,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-01-09 16:02:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:03,878 INFO L225 Difference]: With dead ends: 417 [2025-01-09 16:02:03,878 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 16:02:03,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:03,880 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 68 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:03,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 518 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:02:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 16:02:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2025-01-09 16:02:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 182 states have (on average 1.39010989010989) internal successors, (253), 183 states have internal predecessors, (253), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 299 transitions. [2025-01-09 16:02:03,891 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 299 transitions. Word has length 122 [2025-01-09 16:02:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:03,893 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 299 transitions. [2025-01-09 16:02:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 299 transitions. [2025-01-09 16:02:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:02:03,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:03,895 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:03,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:02:03,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1300323138, now seen corresponding path program 1 times [2025-01-09 16:02:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744198644] [2025-01-09 16:02:03,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:03,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:02:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:02:03,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744198644] [2025-01-09 16:02:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744198644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:03,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:02:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282654483] [2025-01-09 16:02:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:03,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:02:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:03,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:02:03,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:02:03,944 INFO L87 Difference]: Start difference. First operand 210 states and 299 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:03,960 INFO L93 Difference]: Finished difference Result 418 states and 597 transitions. [2025-01-09 16:02:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:02:03,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:02:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:03,962 INFO L225 Difference]: With dead ends: 418 [2025-01-09 16:02:03,962 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 16:02:03,962 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:02:03,962 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:03,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:02:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 16:02:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-01-09 16:02:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.3879781420765027) internal successors, (254), 184 states have internal predecessors, (254), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2025-01-09 16:02:03,971 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 124 [2025-01-09 16:02:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:03,971 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2025-01-09 16:02:03,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2025-01-09 16:02:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:02:03,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:03,972 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:03,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:02:03,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash -505115196, now seen corresponding path program 1 times [2025-01-09 16:02:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51791383] [2025-01-09 16:02:03,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:03,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:02:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:02:04,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:04,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:02:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503099165] [2025-01-09 16:02:04,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:04,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:02:04,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:02:04,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:02:04,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:02:04,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:02:04,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:02:04,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:04,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:04,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 16:02:04,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:04,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:04,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2025-01-09 16:02:04,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:04,549 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 55 treesize of output 19 [2025-01-09 16:02:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:04,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51791383] [2025-01-09 16:02:04,564 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:02:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503099165] [2025-01-09 16:02:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503099165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:04,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:02:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936404895] [2025-01-09 16:02:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:04,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:02:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:04,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:02:04,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:04,565 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:05,216 INFO L93 Difference]: Finished difference Result 478 states and 678 transitions. [2025-01-09 16:02:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:02:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:02:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:05,218 INFO L225 Difference]: With dead ends: 478 [2025-01-09 16:02:05,218 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 16:02:05,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:02:05,219 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 43 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:05,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 426 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:02:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 16:02:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 213. [2025-01-09 16:02:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 186 states have internal predecessors, (256), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2025-01-09 16:02:05,227 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 124 [2025-01-09 16:02:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2025-01-09 16:02:05,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2025-01-09 16:02:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:02:05,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:05,229 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:05,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:02:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:02:05,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1770634560, now seen corresponding path program 1 times [2025-01-09 16:02:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764694639] [2025-01-09 16:02:05,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:02:05,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:02:05,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:05,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:05,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764694639] [2025-01-09 16:02:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764694639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:02:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501836273] [2025-01-09 16:02:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:02:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:05,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:02:05,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:02:05,722 INFO L87 Difference]: Start difference. First operand 213 states and 302 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:06,242 INFO L93 Difference]: Finished difference Result 572 states and 807 transitions. [2025-01-09 16:02:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:02:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:02:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:06,244 INFO L225 Difference]: With dead ends: 572 [2025-01-09 16:02:06,245 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 16:02:06,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:02:06,246 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 125 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:06,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 462 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:02:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 16:02:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 219. [2025-01-09 16:02:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 192 states have internal predecessors, (266), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 312 transitions. [2025-01-09 16:02:06,255 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 312 transitions. Word has length 124 [2025-01-09 16:02:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:06,255 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 312 transitions. [2025-01-09 16:02:06,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 312 transitions. [2025-01-09 16:02:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:02:06,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:06,257 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:06,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:02:06,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1911183170, now seen corresponding path program 1 times [2025-01-09 16:02:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884112351] [2025-01-09 16:02:06,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:06,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:02:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:02:06,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:06,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:02:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:02:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884112351] [2025-01-09 16:02:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884112351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:02:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54869081] [2025-01-09 16:02:06,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:02:06,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:06,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:06,566 INFO L87 Difference]: Start difference. First operand 219 states and 312 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:06,917 INFO L93 Difference]: Finished difference Result 426 states and 601 transitions. [2025-01-09 16:02:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:02:06,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:02:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:06,920 INFO L225 Difference]: With dead ends: 426 [2025-01-09 16:02:06,920 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 16:02:06,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:02:06,921 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 60 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:06,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 541 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:02:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 16:02:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2025-01-09 16:02:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 164 states have (on average 1.3597560975609757) internal successors, (223), 165 states have internal predecessors, (223), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:02:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 269 transitions. [2025-01-09 16:02:06,934 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 269 transitions. Word has length 124 [2025-01-09 16:02:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:06,935 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 269 transitions. [2025-01-09 16:02:06,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:02:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 269 transitions. [2025-01-09 16:02:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:02:06,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:06,936 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:06,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:02:06,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1354494294, now seen corresponding path program 1 times [2025-01-09 16:02:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:02:06,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12136870] [2025-01-09 16:02:06,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:02:06,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:02:07,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:02:07,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:07,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:02:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650466537] [2025-01-09 16:02:07,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:02:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:02:07,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:02:07,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:02:07,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:03:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:03:10,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:10,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:03:10,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:03:14,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:03:14,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:14,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:14,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:03:14,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:03:14,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:03:14,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:03:14,856 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:03:14,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:03:14,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:14 BoogieIcfgContainer [2025-01-09 16:03:14,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:03:14,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:03:14,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:03:14,890 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:03:14,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:55" (3/4) ... [2025-01-09 16:03:14,891 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:03:14,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:03:14,892 INFO L158 Benchmark]: Toolchain (without parser) took 80358.59ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 112.4MB in the beginning and 377.3MB in the end (delta: -264.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2025-01-09 16:03:14,893 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:14,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.58ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 96.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:03:14,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.21ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:14,893 INFO L158 Benchmark]: Boogie Preprocessor took 63.94ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 89.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:03:14,893 INFO L158 Benchmark]: RCFGBuilder took 419.80ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 59.8MB in the end (delta: 30.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:03:14,893 INFO L158 Benchmark]: TraceAbstraction took 79646.77ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 59.0MB in the beginning and 377.4MB in the end (delta: -318.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:14,894 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 453.0MB. Free memory was 377.4MB in the beginning and 377.3MB in the end (delta: 120.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:14,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.58ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 96.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.21ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.94ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 89.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 419.80ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 59.8MB in the end (delta: 30.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 79646.77ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 59.0MB in the beginning and 377.4MB in the end (delta: -318.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 453.0MB. Free memory was 377.4MB in the beginning and 377.3MB in the end (delta: 120.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 113. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L122] isInitial = 1 [L123] FCALL initially() [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L91] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR WrapperStruct00.var_1_2 [L52] EXPR WrapperStruct00.var_1_4 [L52] EXPR WrapperStruct00.var_1_5 [L52] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) [L52] EXPR WrapperStruct00.var_1_4 [L52] EXPR WrapperStruct00.var_1_5 [L52] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3))) [L53] EXPR WrapperStruct00.var_1_8 [L53] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_8 [L65] EXPR WrapperStruct00.var_1_5 [L65] unsigned long int stepLocal_1 = WrapperStruct00.var_1_5; [L66] EXPR WrapperStruct00.var_1_2 [L66] EXPR WrapperStruct00.var_1_3 [L66] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-306783378] [L66] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L66] EXPR WrapperStruct00.var_1_4 [L66] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-306783378] [L66] unsigned long int stepLocal_0 = WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))); [L67] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=17179869156, stepLocal_1=-306783378] [L67] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_5) [L74] EXPR WrapperStruct00.var_1_9 [L74] unsigned char stepLocal_3 = WrapperStruct00.var_1_9; [L75] EXPR WrapperStruct00.var_1_1 [L75] EXPR WrapperStruct00.var_1_7 [L75] signed long int stepLocal_2 = WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7; [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-306783378, stepLocal_2=-107, stepLocal_3=256] [L76] COND FALSE !(((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && stepLocal_3) [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_13 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_2 [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) [L118] EXPR WrapperStruct00.var_1_2 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))) [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_8 [L118] EXPR (WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_8 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR WrapperStruct00.var_1_13 [L118] EXPR (((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118-L119] return ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.6s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 871 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 5228 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3711 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3717 IncrementalHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 1517 mSDtfsCounter, 3717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 678 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=5, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 614 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 64.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1686 ConstructedInterpolants, 0 QuantifiedInterpolants, 3458 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2216 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 5810/5880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:03:14,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-s_file-69.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:16,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:16,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:03:16,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:16,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:16,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:16,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:16,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:16,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:16,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:16,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:16,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:16,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:16,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:16,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:16,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:16,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:16,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:16,973 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 -> 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 [2025-01-09 16:03:17,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:17,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:17,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:17,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:17,219 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:17,220 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-s_file-69.i [2025-01-09 16:03:18,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db335bc39/0ed912b41b934a549a41c7bd6b1cda08/FLAGec28aaf43 [2025-01-09 16:03:18,684 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:18,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2025-01-09 16:03:18,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db335bc39/0ed912b41b934a549a41c7bd6b1cda08/FLAGec28aaf43 [2025-01-09 16:03:18,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db335bc39/0ed912b41b934a549a41c7bd6b1cda08 [2025-01-09 16:03:18,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:18,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:18,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:18,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:18,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:18,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:18,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d2e37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18, skipping insertion in model container [2025-01-09 16:03:18,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:18,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:18,842 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-s_file-69.i[916,929] [2025-01-09 16:03:18,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:18,900 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:18,908 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-s_file-69.i[916,929] [2025-01-09 16:03:18,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:18,968 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:18,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18 WrapperNode [2025-01-09 16:03:18,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:18,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:18,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:18,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:18,974 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:03:18" (1/1) ... [2025-01-09 16:03:18,986 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:03:18" (1/1) ... [2025-01-09 16:03:19,009 INFO L138 Inliner]: procedures = 37, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-01-09 16:03:19,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:19,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:19,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:19,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:19,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,030 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2025-01-09 16:03:19,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:19,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:19,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:19,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:19,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (1/1) ... [2025-01-09 16:03:19,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:19,085 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:03:19,088 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:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:03:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:19,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:19,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:03:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:03:19,194 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:19,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:19,830 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:19,830 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:19,836 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:19,837 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:19,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:19 BoogieIcfgContainer [2025-01-09 16:03:19,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:19,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:19,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:19,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:19,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:18" (1/3) ... [2025-01-09 16:03:19,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b599b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:19, skipping insertion in model container [2025-01-09 16:03:19,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:18" (2/3) ... [2025-01-09 16:03:19,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b599b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:19, skipping insertion in model container [2025-01-09 16:03:19,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:19" (3/3) ... [2025-01-09 16:03:19,843 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-69.i [2025-01-09 16:03:19,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:19,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-69.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:19,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:19,889 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;@92b4fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:19,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:03:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:03:19,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:19,899 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:19,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:19,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 325232512, now seen corresponding path program 1 times [2025-01-09 16:03:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:19,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202192195] [2025-01-09 16:03:19,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:19,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:03:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:19,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:03:19,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:03:20,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:03:20,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:03:20,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:20,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:20,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:20,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:03:20,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:20,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202192195] [2025-01-09 16:03:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202192195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:20,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:03:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342446236] [2025-01-09 16:03:20,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:20,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:20,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:20,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:20,154 INFO L87 Difference]: Start difference. First operand has 93 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:03:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:20,170 INFO L93 Difference]: Finished difference Result 180 states and 284 transitions. [2025-01-09 16:03:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:20,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-01-09 16:03:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:20,175 INFO L225 Difference]: With dead ends: 180 [2025-01-09 16:03:20,175 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 16:03:20,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:03:20,178 INFO L435 NwaCegarLoop]: 132 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, 132 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:03:20,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 16:03:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 16:03:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:03:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-01-09 16:03:20,202 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 119 [2025-01-09 16:03:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-01-09 16:03:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:03:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-01-09 16:03:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:03:20,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:20,205 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:03:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:03:20,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:20,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1225721190, now seen corresponding path program 1 times [2025-01-09 16:03:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196361503] [2025-01-09 16:03:20,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:20,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:03:20,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:20,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:03:20,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:03:20,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:03:20,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:03:20,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:20,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:20,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:20,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:03:20,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:20,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196361503] [2025-01-09 16:03:20,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196361503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:20,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:20,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217805429] [2025-01-09 16:03:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:20,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:20,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:20,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:20,691 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:03:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:20,722 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2025-01-09 16:03:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-01-09 16:03:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:20,724 INFO L225 Difference]: With dead ends: 179 [2025-01-09 16:03:20,724 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 16:03:20,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:20,725 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:20,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 16:03:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 16:03:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:03:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-01-09 16:03:20,733 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2025-01-09 16:03:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:20,734 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-01-09 16:03:20,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:03:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-01-09 16:03:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:03:20,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:20,735 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:20,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:03:20,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:20,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1815020415, now seen corresponding path program 1 times [2025-01-09 16:03:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653325526] [2025-01-09 16:03:20,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:20,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:03:20,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:20,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:03:20,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:03:21,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:03:21,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:03:21,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:21,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:21,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:03:21,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:21,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:03:21,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:21,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2025-01-09 16:03:24,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:24,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 24 [2025-01-09 16:03:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:03:25,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:25,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653325526] [2025-01-09 16:03:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653325526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:03:25,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401410296] [2025-01-09 16:03:25,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:03:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:25,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:03:25,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2025-01-09 16:03:25,014 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:03:28,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:03:31,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]