./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-52.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-52.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 4491c2c71bcb09f93dac0c67ab6bd9a5a290ed536e16d5c9a21e40a7cfd02193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:59:33,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:59:33,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:59:33,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:59:33,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:59:33,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:59:33,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:59:33,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:59:33,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:59:33,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:59:33,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:59:33,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:59:33,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:59:33,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:59:33,810 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:59:33,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:59:33,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:59:33,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:59:33,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:33,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:33,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:33,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:59:33,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:59:33,812 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 -> 4491c2c71bcb09f93dac0c67ab6bd9a5a290ed536e16d5c9a21e40a7cfd02193 [2025-01-09 15:59:34,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:59:34,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:59:34,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:59:34,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:59:34,050 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:59:34,050 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-52.i [2025-01-09 15:59:35,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a741fa07/4b5c8f6179f94abdb5d04cc6b38d0eb6/FLAGb7ea91ba4 [2025-01-09 15:59:35,474 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:59:35,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-52.i [2025-01-09 15:59:35,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a741fa07/4b5c8f6179f94abdb5d04cc6b38d0eb6/FLAGb7ea91ba4 [2025-01-09 15:59:35,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a741fa07/4b5c8f6179f94abdb5d04cc6b38d0eb6 [2025-01-09 15:59:35,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:59:35,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:59:35,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:35,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:59:35,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:59:35,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:35" (1/1) ... [2025-01-09 15:59:35,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edcc854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35, skipping insertion in model container [2025-01-09 15:59:35,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:35" (1/1) ... [2025-01-09 15:59:35,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:59:35,917 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-52.i[916,929] [2025-01-09 15:59:35,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:35,967 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:59:35,977 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-52.i[916,929] [2025-01-09 15:59:35,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:36,009 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:59:36,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36 WrapperNode [2025-01-09 15:59:36,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:36,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:36,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:59:36,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:59:36,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,045 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2025-01-09 15:59:36,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:36,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:59:36,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:59:36,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:59:36,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,067 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:59:36,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:59:36,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:59:36,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:59:36,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:59:36,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (1/1) ... [2025-01-09 15:59:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:36,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:36,126 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 15:59:36,131 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 15:59:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:59:36,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:59:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:59:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:59:36,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:59:36,227 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:59:36,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:59:36,729 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-01-09 15:59:36,729 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:59:36,739 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:59:36,739 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:59:36,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:36 BoogieIcfgContainer [2025-01-09 15:59:36,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:59:36,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:59:36,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:59:36,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:59:36,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:59:35" (1/3) ... [2025-01-09 15:59:36,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44020d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:36, skipping insertion in model container [2025-01-09 15:59:36,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:36" (2/3) ... [2025-01-09 15:59:36,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44020d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:36, skipping insertion in model container [2025-01-09 15:59:36,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:36" (3/3) ... [2025-01-09 15:59:36,747 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-52.i [2025-01-09 15:59:36,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:59:36,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-52.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:59:36,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:59:36,802 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;@1eb9b0f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:59:36,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:59:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 94 states have internal predecessors, (130), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:59:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:59:36,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:36,814 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:36,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:36,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1080321736, now seen corresponding path program 1 times [2025-01-09 15:59:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982339016] [2025-01-09 15:59:36,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:36,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:59:36,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:59:36,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:36,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:59:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982339016] [2025-01-09 15:59:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982339016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322632223] [2025-01-09 15:59:37,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:37,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:37,153 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 15:59:37,154 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 15:59:37,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:59:37,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:59:37,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:37,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:37,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:59:37,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:59:37,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322632223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:37,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:37,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:59:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020516762] [2025-01-09 15:59:37,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:37,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:59:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:37,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:59:37,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:37,434 INFO L87 Difference]: Start difference. First operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 94 states have internal predecessors, (130), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:59:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:37,459 INFO L93 Difference]: Finished difference Result 222 states and 345 transitions. [2025-01-09 15:59:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:59:37,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-01-09 15:59:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:37,466 INFO L225 Difference]: With dead ends: 222 [2025-01-09 15:59:37,467 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:59:37,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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 15:59:37,471 INFO L435 NwaCegarLoop]: 161 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, 161 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 15:59:37,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:59:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 15:59:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:59:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-01-09 15:59:37,511 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 145 [2025-01-09 15:59:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:37,512 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-01-09 15:59:37,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:59:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-01-09 15:59:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:59:37,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:37,515 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:37,525 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 15:59:37,716 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 15:59:37,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:37,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash 871440172, now seen corresponding path program 1 times [2025-01-09 15:59:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050348775] [2025-01-09 15:59:37,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:37,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:59:37,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:59:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:59:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050348775] [2025-01-09 15:59:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050348775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805974168] [2025-01-09 15:59:39,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:39,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:39,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:39,231 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 15:59:39,234 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 15:59:39,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:59:39,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:59:39,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:39,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:39,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:59:39,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:39,456 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 89 treesize of output 59 [2025-01-09 15:59:39,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:39,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 171 [2025-01-09 15:59:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:59:39,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805974168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 15:59:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558676442] [2025-01-09 15:59:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:59:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:39,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:59:39,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:59:39,663 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:59:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:39,885 INFO L93 Difference]: Finished difference Result 258 states and 374 transitions. [2025-01-09 15:59:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:59:39,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:59:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:39,887 INFO L225 Difference]: With dead ends: 258 [2025-01-09 15:59:39,887 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 15:59:39,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:59:39,888 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 49 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:39,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 515 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:59:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 15:59:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2025-01-09 15:59:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:59:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2025-01-09 15:59:39,896 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 145 [2025-01-09 15:59:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2025-01-09 15:59:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:59:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2025-01-09 15:59:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:59:39,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:39,899 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:39,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:59:40,099 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 15:59:40,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1572504750, now seen corresponding path program 1 times [2025-01-09 15:59:40,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839053761] [2025-01-09 15:59:40,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:40,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:59:40,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:59:40,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:59:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839053761] [2025-01-09 15:59:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839053761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090412995] [2025-01-09 15:59:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:40,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:40,852 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 15:59:40,853 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 15:59:40,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:59:41,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:59:41,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:41,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:41,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:59:41,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:41,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:41,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2025-01-09 15:59:41,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:41,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 12 [2025-01-09 15:59:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-09 15:59:41,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:59:41,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:59:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:59:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090412995] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:59:41,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:59:41,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2025-01-09 15:59:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060174179] [2025-01-09 15:59:41,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:59:41,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:59:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:41,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:59:41,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:59:41,865 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 16 states have internal predecessors, (112), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2025-01-09 15:59:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:42,901 INFO L93 Difference]: Finished difference Result 329 states and 469 transitions. [2025-01-09 15:59:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:59:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 16 states have internal predecessors, (112), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) Word has length 145 [2025-01-09 15:59:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:42,903 INFO L225 Difference]: With dead ends: 329 [2025-01-09 15:59:42,903 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 15:59:42,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 280 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:59:42,905 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 720 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:42,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 530 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:59:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 15:59:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2025-01-09 15:59:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 168 states have (on average 1.3511904761904763) internal successors, (227), 170 states have internal predecessors, (227), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:59:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 287 transitions. [2025-01-09 15:59:42,935 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 287 transitions. Word has length 145 [2025-01-09 15:59:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:42,936 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 287 transitions. [2025-01-09 15:59:42,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.615384615384615) internal successors, (112), 16 states have internal predecessors, (112), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2025-01-09 15:59:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 287 transitions. [2025-01-09 15:59:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:59:42,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:42,940 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:59:42,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:59:43,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:43,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1460363753, now seen corresponding path program 1 times [2025-01-09 15:59:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623302430] [2025-01-09 15:59:43,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:43,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:59:43,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:59:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:59:43,236 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:59:43,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:59:43,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:59:43,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:59:43,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:59:43,333 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:59:43,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:59:43,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:59:43,337 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 15:59:43,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:59:43,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:59:43 BoogieIcfgContainer [2025-01-09 15:59:43,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:59:43,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:59:43,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:59:43,397 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:59:43,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:36" (3/4) ... [2025-01-09 15:59:43,402 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:59:43,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:59:43,404 INFO L158 Benchmark]: Toolchain (without parser) took 7616.31ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 134.1MB in the beginning and 174.4MB in the end (delta: -40.3MB). Peak memory consumption was 153.9MB. Max. memory is 16.1GB. [2025-01-09 15:59:43,404 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:43,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.05ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 117.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:59:43,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.47ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 114.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:43,405 INFO L158 Benchmark]: Boogie Preprocessor took 54.31ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 111.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:59:43,405 INFO L158 Benchmark]: RCFGBuilder took 639.49ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 79.8MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:59:43,406 INFO L158 Benchmark]: TraceAbstraction took 6654.66ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 79.4MB in the beginning and 174.5MB in the end (delta: -95.0MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2025-01-09 15:59:43,406 INFO L158 Benchmark]: Witness Printer took 6.28ms. Allocated memory is still 360.7MB. Free memory was 174.5MB in the beginning and 174.4MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:43,408 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.19ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.05ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 117.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.47ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 114.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.31ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 111.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 639.49ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 79.8MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6654.66ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 79.4MB in the beginning and 174.5MB in the end (delta: -95.0MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. * Witness Printer took 6.28ms. Allocated memory is still 360.7MB. Free memory was 174.5MB in the beginning and 174.4MB in the end (delta: 48.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 someBinaryArithmeticDOUBLEoperation at line 71, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { -4, 32, -1, 1, 0, 0, 1, 0, 25.7, 256.5, 0.0, 31.1, 256.6, 8, 16 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L122] isInitial = 1 [L123] FCALL initially() [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] 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] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L89] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 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_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) 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_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) 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_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) 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_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 1) 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_8 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) 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_8 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] 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] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] 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] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 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] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 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] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_13 [L108] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_13 [L108] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+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] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_14 [L110] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_14 [L110] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 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] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 30) 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_16 <= 30) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L60] EXPR WrapperStruct00.var_1_3 [L60] signed short int stepLocal_0 = WrapperStruct00.var_1_3; [L61] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=13] [L61] COND FALSE !(stepLocal_0 > ((WrapperStruct00.var_1_4 / -256) * 32)) [L68] EXPR WrapperStruct00.var_1_9 [L68] WrapperStruct00.var_1_5 = WrapperStruct00.var_1_9 [L70] WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND TRUE WrapperStruct00.var_1_7 [L71] EXPR WrapperStruct00.var_1_11 [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14) [L71] EXPR WrapperStruct00.var_1_12 [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L71] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))) [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] COND TRUE WrapperStruct00.var_1_10 < 63.75 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_1 = (10 - WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4))) [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR (WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1)) && ((! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_3) + (-2 << WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_3)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L118-L119] return ((((WrapperStruct00.var_1_10 < 63.75) ? (WrapperStruct00.var_1_1 == ((signed short int) (10 - WrapperStruct00.var_1_3))) : (WrapperStruct00.var_1_1 == ((signed short int) (4 + WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_3 > ((WrapperStruct00.var_1_4 / -256) * 32)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) (! (WrapperStruct00.var_1_7 && WrapperStruct00.var_1_8)))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_14)))))) : 1)) && ((! (WrapperStruct00.var_1_13 < (127.125 / WrapperStruct00.var_1_12))) ? ((WrapperStruct00.var_1_1 <= ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_3) + (-2 << WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_3)) : 1) : 1) ; [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, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 1206 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1042 IncrementalHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 391 mSDtfsCounter, 1042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 579 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1008 ConstructedInterpolants, 0 QuantifiedInterpolants, 3905 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1497 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4118/4284 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 15:59:43,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-52.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 4491c2c71bcb09f93dac0c67ab6bd9a5a290ed536e16d5c9a21e40a7cfd02193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:59:45,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:59:45,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:59:45,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:59:45,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:59:45,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:59:45,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:59:45,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:59:45,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:59:45,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:59:45,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:59:45,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:59:45,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:59:45,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:59:45,450 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:59:45,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:59:45,451 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:59:45,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:59:45,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:59:45,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:59:45,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:59:45,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:59:45,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:45,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:45,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:45,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:59:45,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:59:45,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 -> 4491c2c71bcb09f93dac0c67ab6bd9a5a290ed536e16d5c9a21e40a7cfd02193 [2025-01-09 15:59:45,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:59:45,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:59:45,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:59:45,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:59:45,690 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:59:45,693 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-52.i [2025-01-09 15:59:46,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/effdb2816/da5683ce34794b67a6bcca78e1eca26d/FLAG9f78761f2 [2025-01-09 15:59:47,049 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:59:47,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-52.i [2025-01-09 15:59:47,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/effdb2816/da5683ce34794b67a6bcca78e1eca26d/FLAG9f78761f2 [2025-01-09 15:59:47,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/effdb2816/da5683ce34794b67a6bcca78e1eca26d [2025-01-09 15:59:47,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:59:47,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:59:47,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:47,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:59:47,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:59:47,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef05dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47, skipping insertion in model container [2025-01-09 15:59:47,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:59:47,224 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-52.i[916,929] [2025-01-09 15:59:47,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:47,304 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:59:47,312 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-52.i[916,929] [2025-01-09 15:59:47,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:47,372 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:59:47,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47 WrapperNode [2025-01-09 15:59:47,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:47,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:47,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:59:47,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:59:47,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,420 INFO L138 Inliner]: procedures = 37, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2025-01-09 15:59:47,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:47,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:59:47,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:59:47,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:59:47,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,440 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-01-09 15:59:47,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:59:47,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:59:47,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:59:47,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:59:47,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (1/1) ... [2025-01-09 15:59:47,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:47,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:47,501 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 15:59:47,505 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 15:59:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:59:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:59:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:59:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:59:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:59:47,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:59:47,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:59:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:59:47,630 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:59:47,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:00:04,771 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-01-09 16:00:04,771 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:00:04,777 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:00:04,777 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:00:04,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:04 BoogieIcfgContainer [2025-01-09 16:00:04,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:00:04,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:00:04,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:00:04,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:00:04,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:59:47" (1/3) ... [2025-01-09 16:00:04,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7dc6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:04, skipping insertion in model container [2025-01-09 16:00:04,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:47" (2/3) ... [2025-01-09 16:00:04,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7dc6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:04, skipping insertion in model container [2025-01-09 16:00:04,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:04" (3/3) ... [2025-01-09 16:00:04,783 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-52.i [2025-01-09 16:00:04,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:00:04,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-52.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:00:04,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:00:04,828 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;@11506545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:00:04,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:00:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 90 states have internal predecessors, (124), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:00:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 16:00:04,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:04,838 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:04,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:04,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1588728380, now seen corresponding path program 1 times [2025-01-09 16:00:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:00:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352402182] [2025-01-09 16:00:04,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:04,849 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:00:04,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:00:04,853 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:00:04,854 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:00:04,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 16:00:05,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 16:00:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:05,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:00:05,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 16:00:05,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:00:05,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:00:05,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352402182] [2025-01-09 16:00:05,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352402182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:05,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:05,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:00:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102660917] [2025-01-09 16:00:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:05,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:00:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:00:05,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:00:05,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:00:05,649 INFO L87 Difference]: Start difference. First operand has 110 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 90 states have internal predecessors, (124), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:05,667 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2025-01-09 16:00:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:00:05,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-01-09 16:00:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:05,673 INFO L225 Difference]: With dead ends: 214 [2025-01-09 16:00:05,673 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 16:00:05,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:00:05,677 INFO L435 NwaCegarLoop]: 155 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, 155 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:00:05,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:00:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 16:00:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 16:00:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:00:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-01-09 16:00:05,703 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 145 [2025-01-09 16:00:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:05,703 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-01-09 16:00:05,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-01-09 16:00:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 16:00:05,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:05,706 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:05,724 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:00:05,910 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:00:05,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1797609944, now seen corresponding path program 1 times [2025-01-09 16:00:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:00:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000859926] [2025-01-09 16:00:05,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:05,913 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:00:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:00:05,916 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:00:05,917 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:00:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 16:00:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 16:00:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:06,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:00:06,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 16:00:07,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:00:07,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:00:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000859926] [2025-01-09 16:00:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000859926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:00:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31073292] [2025-01-09 16:00:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:00:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:00:07,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:00:07,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:00:07,053 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:07,253 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2025-01-09 16:00:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:00:07,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-01-09 16:00:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:07,255 INFO L225 Difference]: With dead ends: 213 [2025-01-09 16:00:07,255 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:00:07,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:00:07,256 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:07,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:00:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:00:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 16:00:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:00:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 16:00:07,264 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 145 [2025-01-09 16:00:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 16:00:07,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 16:00:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 16:00:07,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:07,266 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:07,287 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 (3)] Ended with exit code 0 [2025-01-09 16:00:07,467 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:00:07,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:07,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:07,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2073710630, now seen corresponding path program 1 times [2025-01-09 16:00:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:00:07,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723015885] [2025-01-09 16:00:07,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:07,468 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:00:07,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:00:07,477 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:00:07,478 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:00:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 16:00:08,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 16:00:08,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:08,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:08,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:00:08,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:10,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:10,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 16:00:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 16:00:10,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:00:10,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:00:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723015885] [2025-01-09 16:00:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723015885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:00:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135254572] [2025-01-09 16:00:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:10,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:00:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:00:10,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:00:10,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:00:10,333 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:18,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:23,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:26,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:30,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:34,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:38,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:40,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:00:40,227 INFO L93 Difference]: Finished difference Result 216 states and 312 transitions. [2025-01-09 16:00:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:00:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-01-09 16:00:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:00:40,231 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:00:40,231 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 16:00:40,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:00:40,233 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 111 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:00:40,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 409 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 4 Unknown, 0 Unchecked, 29.6s Time] [2025-01-09 16:00:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 16:00:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 16:00:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:00:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-01-09 16:00:40,240 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 145 [2025-01-09 16:00:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:00:40,240 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-01-09 16:00:40,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-01-09 16:00:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 16:00:40,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:00:40,242 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:40,263 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 (4)] Ended with exit code 0 [2025-01-09 16:00:40,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:00:40,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:00:40,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:00:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1114067328, now seen corresponding path program 1 times [2025-01-09 16:00:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:00:40,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170841852] [2025-01-09 16:00:40,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:00:40,447 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:00:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:00:40,450 INFO L229 MonitoredProcess]: Starting monitored process 5 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:00:40,453 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 (5)] Waiting until timeout for monitored process [2025-01-09 16:00:40,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 16:00:41,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 16:00:41,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:00:41,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:00:41,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:00:41,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:00:43,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:00:43,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2025-01-09 16:00:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-09 16:00:43,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:00:43,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:00:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170841852] [2025-01-09 16:00:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170841852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:00:43,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:00:43,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:00:43,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306655943] [2025-01-09 16:00:43,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:00:43,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:00:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:00:43,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:00:43,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:00:43,329 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:00:51,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:52,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:56,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:00:59,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:05,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:06,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:09,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:10,043 INFO L93 Difference]: Finished difference Result 216 states and 310 transitions. [2025-01-09 16:01:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:01:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-01-09 16:01:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:10,054 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:01:10,054 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 16:01:10,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:10,055 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 101 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:10,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 405 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 3 Unknown, 0 Unchecked, 26.4s Time] [2025-01-09 16:01:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 16:01:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 16:01:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:01:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-01-09 16:01:10,071 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 147 [2025-01-09 16:01:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:10,072 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-01-09 16:01:10,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 16:01:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-01-09 16:01:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:01:10,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:10,077 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,099 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 (5)] Ended with exit code 0 [2025-01-09 16:01:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:01:10,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash 81157028, now seen corresponding path program 1 times [2025-01-09 16:01:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027340811] [2025-01-09 16:01:10,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:10,279 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:01:10,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:10,282 INFO L229 MonitoredProcess]: Starting monitored process 6 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:01:10,283 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 (6)] Waiting until timeout for monitored process [2025-01-09 16:01:10,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:01:10,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:01:10,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:10,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:10,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:01:10,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-01-09 16:01:11,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:11,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027340811] [2025-01-09 16:01:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027340811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:11,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:01:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512674313] [2025-01-09 16:01:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:11,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:01:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:11,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:01:11,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:11,280 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 16:01:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:12,564 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2025-01-09 16:01:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:01:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-01-09 16:01:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:12,569 INFO L225 Difference]: With dead ends: 219 [2025-01-09 16:01:12,569 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 16:01:12,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:12,570 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:12,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 615 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:01:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 16:01:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-01-09 16:01:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:01:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-01-09 16:01:12,582 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 149 [2025-01-09 16:01:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:12,583 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-01-09 16:01:12,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 16:01:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-01-09 16:01:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:01:12,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:12,585 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,607 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 (6)] Ended with exit code 0 [2025-01-09 16:01:12,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:01:12,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:12,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -352572058, now seen corresponding path program 1 times [2025-01-09 16:01:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:12,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110558432] [2025-01-09 16:01:12,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:12,788 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:01:12,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:12,792 INFO L229 MonitoredProcess]: Starting monitored process 7 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:01:12,796 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 (7)] Waiting until timeout for monitored process [2025-01-09 16:01:12,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:01:13,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:01:13,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:13,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:13,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:01:13,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:15,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:01:15,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 16:01:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-01-09 16:01:15,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:15,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:15,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110558432] [2025-01-09 16:01:15,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110558432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:15,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:01:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772537381] [2025-01-09 16:01:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:01:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:01:15,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:15,463 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)