./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:39:51,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:39:51,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:39:51,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:39:51,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:39:51,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:39:51,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:39:51,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:39:51,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:39:51,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:39:51,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:39:51,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:39:51,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:39:51,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:39:51,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:39:51,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:39:51,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:39:51,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:39:51,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:39:51,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:39:51,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:39:51,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:39:51,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:39:51,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:51,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:39:51,212 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 [2025-03-04 01:39:51,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:39:51,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:39:51,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:39:51,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:39:51,443 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:39:51,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2025-03-04 01:39:52,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd95fa348/cd0e1739ddef4b1385ae5b2229e400a3/FLAGfbbd4a6e0 [2025-03-04 01:39:52,793 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:39:52,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2025-03-04 01:39:52,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd95fa348/cd0e1739ddef4b1385ae5b2229e400a3/FLAGfbbd4a6e0 [2025-03-04 01:39:53,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd95fa348/cd0e1739ddef4b1385ae5b2229e400a3 [2025-03-04 01:39:53,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:39:53,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:39:53,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:53,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:39:53,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:39:53,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22af4879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53, skipping insertion in model container [2025-03-04 01:39:53,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:39:53,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2025-03-04 01:39:53,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:53,285 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:39:53,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2025-03-04 01:39:53,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:53,350 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:39:53,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53 WrapperNode [2025-03-04 01:39:53,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:53,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:53,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:39:53,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:39:53,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,392 INFO L138 Inliner]: procedures = 30, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 560 [2025-03-04 01:39:53,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:53,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:39:53,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:39:53,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:39:53,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,410 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:39:53,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:39:53,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:39:53,428 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:39:53,428 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:39:53,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (1/1) ... [2025-03-04 01:39:53,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:53,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:53,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:39:53,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:39:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:39:53,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:39:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:39:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:39:53,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:39:53,571 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:39:53,572 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:39:54,160 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite123#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem124#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite153#1;havoc property_#t~mem136#1;havoc property_#t~ite152#1;havoc property_#t~mem140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~short139#1;havoc property_#t~mem151#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~short144#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~short147#1;havoc property_#t~mem148#1;havoc property_#t~short149#1;havoc property_#t~short150#1;havoc property_#t~short154#1;havoc property_#t~mem155#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-03-04 01:39:54,193 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-03-04 01:39:54,193 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:39:54,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:39:54,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:39:54,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:54 BoogieIcfgContainer [2025-03-04 01:39:54,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:39:54,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:39:54,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:39:54,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:39:54,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:39:53" (1/3) ... [2025-03-04 01:39:54,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d831b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:54, skipping insertion in model container [2025-03-04 01:39:54,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:53" (2/3) ... [2025-03-04 01:39:54,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d831b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:54, skipping insertion in model container [2025-03-04 01:39:54,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:54" (3/3) ... [2025-03-04 01:39:54,210 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-45.i [2025-03-04 01:39:54,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:39:54,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-45.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:39:54,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:39:54,276 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;@c12897a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:39:54,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:39:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 112 states have internal predecessors, (154), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:39:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:39:54,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:54,288 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:54,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash -47633033, now seen corresponding path program 1 times [2025-03-04 01:39:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228328013] [2025-03-04 01:39:54,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:54,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:54,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:39:54,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:39:54,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:54,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-04 01:39:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228328013] [2025-03-04 01:39:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228328013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639629183] [2025-03-04 01:39:54,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:54,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:54,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:39:54,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:39:54,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:39:54,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:39:54,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:54,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:54,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:39:54,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-04 01:39:54,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639629183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:39:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437119255] [2025-03-04 01:39:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:39:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:54,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:39:54,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:54,953 INFO L87 Difference]: Start difference. First operand has 139 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 112 states have internal predecessors, (154), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:39:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:54,972 INFO L93 Difference]: Finished difference Result 272 states and 428 transitions. [2025-03-04 01:39:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:39:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2025-03-04 01:39:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:54,978 INFO L225 Difference]: With dead ends: 272 [2025-03-04 01:39:54,978 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:39:54,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 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-03-04 01:39:54,982 INFO L435 NwaCegarLoop]: 199 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, 199 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-03-04 01:39:54,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:39:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 01:39:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:39:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2025-03-04 01:39:55,017 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 189 [2025-03-04 01:39:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:55,020 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2025-03-04 01:39:55,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:39:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2025-03-04 01:39:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:39:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:55,023 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:55,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:39:55,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:39:55,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:55,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1033733510, now seen corresponding path program 1 times [2025-03-04 01:39:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:55,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667190157] [2025-03-04 01:39:55,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:55,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:39:55,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:39:55,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:55,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:39:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667190157] [2025-03-04 01:39:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667190157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157112441] [2025-03-04 01:39:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:55,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:55,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:55,524 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:39:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:55,571 INFO L93 Difference]: Finished difference Result 271 states and 398 transitions. [2025-03-04 01:39:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2025-03-04 01:39:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:55,573 INFO L225 Difference]: With dead ends: 271 [2025-03-04 01:39:55,573 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:39:55,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:55,574 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:55,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:39:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 01:39:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:39:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2025-03-04 01:39:55,594 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 189 [2025-03-04 01:39:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:55,595 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2025-03-04 01:39:55,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:39:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2025-03-04 01:39:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:39:55,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:55,597 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:55,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:39:55,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:55,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash -843535385, now seen corresponding path program 1 times [2025-03-04 01:39:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:55,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252416221] [2025-03-04 01:39:55,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:55,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:55,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:39:55,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:39:55,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:39:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252416221] [2025-03-04 01:39:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252416221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:57,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237752374] [2025-03-04 01:39:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:57,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:57,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:57,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:57,691 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:39:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:57,959 INFO L93 Difference]: Finished difference Result 408 states and 597 transitions. [2025-03-04 01:39:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:57,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2025-03-04 01:39:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:57,962 INFO L225 Difference]: With dead ends: 408 [2025-03-04 01:39:57,962 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 01:39:57,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:57,966 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:57,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 347 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 01:39:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 260. [2025-03-04 01:39:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:39:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2025-03-04 01:39:57,998 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 189 [2025-03-04 01:39:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:57,998 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2025-03-04 01:39:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:39:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2025-03-04 01:39:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:39:58,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:58,002 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:39:58,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:58,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1061476137, now seen corresponding path program 1 times [2025-03-04 01:39:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350340241] [2025-03-04 01:39:58,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:58,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:39:58,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:39:58,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:39:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350340241] [2025-03-04 01:39:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350340241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997842918] [2025-03-04 01:39:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:58,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:58,399 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:39:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:58,417 INFO L93 Difference]: Finished difference Result 517 states and 757 transitions. [2025-03-04 01:39:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:58,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2025-03-04 01:39:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:58,421 INFO L225 Difference]: With dead ends: 517 [2025-03-04 01:39:58,422 INFO L226 Difference]: Without dead ends: 260 [2025-03-04 01:39:58,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:58,423 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:58,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-04 01:39:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-04 01:39:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 207 states have internal predecessors, (278), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:39:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 378 transitions. [2025-03-04 01:39:58,447 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 378 transitions. Word has length 191 [2025-03-04 01:39:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 378 transitions. [2025-03-04 01:39:58,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:39:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 378 transitions. [2025-03-04 01:39:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:39:58,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:58,449 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:58,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:39:58,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:58,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:58,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1190558856, now seen corresponding path program 1 times [2025-03-04 01:39:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756809220] [2025-03-04 01:39:58,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:58,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:39:58,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:39:58,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:58,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:39:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756809220] [2025-03-04 01:39:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756809220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:59,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:59,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714473012] [2025-03-04 01:39:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:59,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:59,251 INFO L87 Difference]: Start difference. First operand 260 states and 378 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:39:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:59,558 INFO L93 Difference]: Finished difference Result 517 states and 753 transitions. [2025-03-04 01:39:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2025-03-04 01:39:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:59,563 INFO L225 Difference]: With dead ends: 517 [2025-03-04 01:39:59,563 INFO L226 Difference]: Without dead ends: 260 [2025-03-04 01:39:59,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:59,565 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:59,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:39:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-04 01:39:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-04 01:39:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 207 states have (on average 1.3333333333333333) internal successors, (276), 207 states have internal predecessors, (276), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:39:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2025-03-04 01:39:59,588 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 376 transitions. Word has length 191 [2025-03-04 01:39:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 376 transitions. [2025-03-04 01:39:59,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:39:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 376 transitions. [2025-03-04 01:39:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:39:59,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:59,594 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:59,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:39:59,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:59,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1401909769, now seen corresponding path program 1 times [2025-03-04 01:39:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325427376] [2025-03-04 01:39:59,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:59,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:39:59,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:39:59,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:59,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:39:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325427376] [2025-03-04 01:39:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325427376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:59,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:59,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591224369] [2025-03-04 01:39:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:59,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:59,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:59,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:59,853 INFO L87 Difference]: Start difference. First operand 260 states and 376 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:39:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:59,875 INFO L93 Difference]: Finished difference Result 480 states and 696 transitions. [2025-03-04 01:39:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:59,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 191 [2025-03-04 01:39:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:59,877 INFO L225 Difference]: With dead ends: 480 [2025-03-04 01:39:59,878 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 01:39:59,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:59,881 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:59,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 01:39:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 138. [2025-03-04 01:39:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:39:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2025-03-04 01:39:59,888 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 191 [2025-03-04 01:39:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:59,889 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2025-03-04 01:39:59,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:39:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2025-03-04 01:39:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:39:59,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:59,890 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:59,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:39:59,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1819178059, now seen corresponding path program 1 times [2025-03-04 01:39:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757331593] [2025-03-04 01:39:59,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:59,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:40:00,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:40:00,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:00,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:40:00,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202153540] [2025-03-04 01:40:00,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:00,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:00,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:00,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:40:00,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:40:01,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:40:01,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:01,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:40:01,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:40:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:40:02,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:40:02,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:02,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:40:02,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:40:02,397 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:40:02,397 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:40:02,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:02,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 01:40:02,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:02,646 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:40:02,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:40:02 BoogieIcfgContainer [2025-03-04 01:40:02,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:40:02,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:40:02,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:40:02,648 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:40:02,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:54" (3/4) ... [2025-03-04 01:40:02,650 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:40:02,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:40:02,651 INFO L158 Benchmark]: Toolchain (without parser) took 9518.01ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 112.4MB in the beginning and 254.8MB in the end (delta: -142.5MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. [2025-03-04 01:40:02,652 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 123.7MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:02,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.78ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 94.0MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:40:02,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 89.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:40:02,652 INFO L158 Benchmark]: Boogie Preprocessor took 34.94ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 86.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:02,652 INFO L158 Benchmark]: IcfgBuilder took 774.71ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 48.2MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:40:02,653 INFO L158 Benchmark]: TraceAbstraction took 8443.26ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 47.8MB in the beginning and 254.9MB in the end (delta: -207.2MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2025-03-04 01:40:02,653 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 486.5MB. Free memory was 254.9MB in the beginning and 254.8MB in the end (delta: 99.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:02,654 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.16ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 123.7MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.78ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 94.0MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 89.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.94ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 86.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 774.71ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 48.2MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8443.26ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 47.8MB in the beginning and 254.9MB in the end (delta: -207.2MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 486.5MB. Free memory was 254.9MB in the beginning and 254.8MB in the end (delta: 99.2kB). 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 someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 131. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 999999.2, 5, -2, 0.0, 5.9, 255.6, 25.5, 0, 0.0, 1, 0, 0, 0, 1, 1, 64, -10, 5 }; [L63] unsigned char last_1_WrapperStruct00_var_1_18 = 64; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_18=64] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_18 [L128] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_long() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L93] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] EXPR (WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L96] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L98] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_11 [L103] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_11 [L103] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L103] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && 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, last_1_WrapperStruct00_var_1_18=64] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && 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, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && 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, last_1_WrapperStruct00_var_1_18=64] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L107] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L110] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L113] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L119] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L123] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L139] RET updateVariables() [L140] CALL step() [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_4 [L67] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L67] COND TRUE ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_4) / WrapperStruct00.var_1_19) != last_1_WrapperStruct00_var_1_18 [L68] EXPR WrapperStruct00.var_1_20 [L68] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_20 [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L70] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L70] COND TRUE (WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18))) [L71] EXPR WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_7 [L71] EXPR WrapperStruct00.var_1_8 [L71] WrapperStruct00.var_1_1 = ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8) [L75] EXPR WrapperStruct00.var_1_18 [L75] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L75] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L76] COND TRUE WrapperStruct00.var_1_10 [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L77] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14) [L82] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L82] COND FALSE !(WrapperStruct00.var_1_12) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) [L131] EXPR WrapperStruct00.var_1_18 [L131] EXPR (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR ((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7))) [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_6 [L131] EXPR WrapperStruct00.var_1_7 [L131] EXPR WrapperStruct00.var_1_8 [L131] EXPR ((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR (((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR ((((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1)) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) (((WrapperStruct00.var_1_8 >= WrapperStruct00.var_1_1) || WrapperStruct00.var_1_15) && ((WrapperStruct00.var_1_13 || WrapperStruct00.var_1_16) && WrapperStruct00.var_1_17))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131] EXPR (((((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1)) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) (((WrapperStruct00.var_1_8 >= WrapperStruct00.var_1_1) || WrapperStruct00.var_1_15) && ((WrapperStruct00.var_1_13 || WrapperStruct00.var_1_16) && WrapperStruct00.var_1_17))))) : 1)) && ((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_4) / WrapperStruct00.var_1_19) != last_1_WrapperStruct00_var_1_18) ? (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_20)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L131-L132] return (((((WrapperStruct00.var_1_18 / 32) < (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) < (WrapperStruct00.var_1_18)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_18)))) ? (WrapperStruct00.var_1_1 == ((double) ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7) - WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_9 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6))) - (WrapperStruct00.var_1_11 - 0.8f)))) : 1)) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) (((WrapperStruct00.var_1_8 >= WrapperStruct00.var_1_1) || WrapperStruct00.var_1_15) && ((WrapperStruct00.var_1_13 || WrapperStruct00.var_1_16) && WrapperStruct00.var_1_17))))) : 1)) && ((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_4) / WrapperStruct00.var_1_19) != last_1_WrapperStruct00_var_1_18) ? (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_20)) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 2327 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1226 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1101 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 6 MinimizatonAttempts, 98 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1713 NumberOfCodeBlocks, 1713 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1322 ConstructedInterpolants, 0 QuantifiedInterpolants, 1949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 8352/8400 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-03-04 01:40:02,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:40:04,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:40:04,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:40:04,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:40:04,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:40:04,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:40:04,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:40:04,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:40:04,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:40:04,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:40:04,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:40:04,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:40:04,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:40:04,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:40:04,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:40:04,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:40:04,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:40:04,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:40:04,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:40:04,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:40:04,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:40:04,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:04,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:40:04,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:40:04,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:40:04,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:40:04,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 713991985049fa177433ff2ab0be75ca88d9e4252e5948e9e1205b00831a46f2 [2025-03-04 01:40:04,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:40:04,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:40:04,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:40:04,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:40:04,847 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:40:04,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2025-03-04 01:40:06,008 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03c1158c/a8ed7bc84f604be680cf23a457791f34/FLAG80fcb86ba [2025-03-04 01:40:06,197 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:40:06,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i [2025-03-04 01:40:06,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03c1158c/a8ed7bc84f604be680cf23a457791f34/FLAG80fcb86ba [2025-03-04 01:40:06,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03c1158c/a8ed7bc84f604be680cf23a457791f34 [2025-03-04 01:40:06,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:40:06,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:40:06,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:06,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:40:06,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:40:06,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73431a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06, skipping insertion in model container [2025-03-04 01:40:06,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:40:06,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2025-03-04 01:40:06,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:06,775 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:40:06,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-45.i[916,929] [2025-03-04 01:40:06,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:06,844 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:40:06,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06 WrapperNode [2025-03-04 01:40:06,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:06,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:06,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:40:06,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:40:06,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,906 INFO L138 Inliner]: procedures = 40, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2025-03-04 01:40:06,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:06,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:40:06,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:40:06,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:40:06,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,932 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 39 writes are split as follows [0, 39]. [2025-03-04 01:40:06,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:40:06,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:40:06,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:40:06,977 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:40:06,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (1/1) ... [2025-03-04 01:40:06,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:07,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:40:07,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:40:07,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:40:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:40:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:40:07,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:40:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:40:07,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:40:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:40:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:40:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:40:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:40:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:40:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:40:07,142 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:40:07,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:40:17,163 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite123#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem124#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite153#1;havoc property_#t~mem136#1;havoc property_#t~ite152#1;havoc property_#t~mem140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~short139#1;havoc property_#t~mem151#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~short144#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~short147#1;havoc property_#t~mem148#1;havoc property_#t~short149#1;havoc property_#t~short150#1;havoc property_#t~short154#1;havoc property_#t~mem155#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-03-04 01:40:17,208 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-03-04 01:40:17,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:40:17,217 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:40:17,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:40:17,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:17 BoogieIcfgContainer [2025-03-04 01:40:17,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:40:17,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:40:17,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:40:17,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:40:17,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:40:06" (1/3) ... [2025-03-04 01:40:17,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e025e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:17, skipping insertion in model container [2025-03-04 01:40:17,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:06" (2/3) ... [2025-03-04 01:40:17,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e025e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:17, skipping insertion in model container [2025-03-04 01:40:17,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:17" (3/3) ... [2025-03-04 01:40:17,224 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-45.i [2025-03-04 01:40:17,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:40:17,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-45.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:40:17,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:40:17,281 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;@1fe652e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:40:17,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:40:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 112 states have internal predecessors, (154), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:40:17,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:17,297 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:17,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:17,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1541290781, now seen corresponding path program 1 times [2025-03-04 01:40:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590173540] [2025-03-04 01:40:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:17,320 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-03-04 01:40:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:17,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 01:40:17,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:17,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:40:17,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:40:17,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:17,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:17,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:40:17,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-04 01:40:17,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:17,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:17,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590173540] [2025-03-04 01:40:17,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590173540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:17,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:17,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:40:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772427430] [2025-03-04 01:40:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:40:17,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:17,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:40:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:40:17,892 INFO L87 Difference]: Start difference. First operand has 139 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 112 states have internal predecessors, (154), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:17,913 INFO L93 Difference]: Finished difference Result 272 states and 428 transitions. [2025-03-04 01:40:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:40:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 189 [2025-03-04 01:40:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:17,920 INFO L225 Difference]: With dead ends: 272 [2025-03-04 01:40:17,921 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:40:17,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 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-03-04 01:40:17,926 INFO L435 NwaCegarLoop]: 199 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, 199 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-03-04 01:40:17,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:40:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 01:40:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2025-03-04 01:40:17,961 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 189 [2025-03-04 01:40:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2025-03-04 01:40:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2025-03-04 01:40:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:40:17,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:17,966 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:17,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:18,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 01:40:18,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1672309972, now seen corresponding path program 1 times [2025-03-04 01:40:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56392252] [2025-03-04 01:40:18,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:18,169 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-03-04 01:40:18,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:18,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 01:40:18,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:18,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:40:18,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:40:18,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:18,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:18,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:18,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:18,721 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 31 treesize of output 13 [2025-03-04 01:40:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:40:18,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:18,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:18,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56392252] [2025-03-04 01:40:18,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56392252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:18,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:18,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:40:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186160586] [2025-03-04 01:40:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:18,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:40:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:18,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:40:18,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:18,775 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:40:20,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:40:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:20,333 INFO L93 Difference]: Finished difference Result 269 states and 395 transitions. [2025-03-04 01:40:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:40:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2025-03-04 01:40:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:20,335 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:40:20,335 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:40:20,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:20,337 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:20,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:40:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:40:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 01:40:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions. [2025-03-04 01:40:20,354 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 189 [2025-03-04 01:40:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 198 transitions. [2025-03-04 01:40:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:40:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions. [2025-03-04 01:40:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:40:20,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:20,357 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:20,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:20,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-04 01:40:20,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:20,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1778185453, now seen corresponding path program 1 times [2025-03-04 01:40:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:20,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495275623] [2025-03-04 01:40:20,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:20,559 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-03-04 01:40:20,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:20,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-04 01:40:20,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:40:21,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:40:21,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:21,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:21,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:21,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:21,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 01:40:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:40:21,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:21,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495275623] [2025-03-04 01:40:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495275623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:21,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:21,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:40:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252456364] [2025-03-04 01:40:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:21,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:40:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:21,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:40:21,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:21,104 INFO L87 Difference]: Start difference. First operand 136 states and 198 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:40:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:21,139 INFO L93 Difference]: Finished difference Result 269 states and 393 transitions. [2025-03-04 01:40:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:40:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2025-03-04 01:40:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:21,141 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:40:21,141 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:40:21,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:40:21,142 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:21,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:40:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 01:40:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2025-03-04 01:40:21,156 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 189 [2025-03-04 01:40:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:21,157 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2025-03-04 01:40:21,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:40:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2025-03-04 01:40:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:40:21,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:21,159 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:21,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-04 01:40:21,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -204993419, now seen corresponding path program 1 times [2025-03-04 01:40:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584774940] [2025-03-04 01:40:21,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:21,361 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-03-04 01:40:21,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:21,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-04 01:40:21,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:21,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:40:21,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:40:21,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:21,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:21,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:40:21,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:22,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:22,017 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-03-04 01:40:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2025-03-04 01:40:22,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:22,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:22,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584774940] [2025-03-04 01:40:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584774940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:22,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:22,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714472395] [2025-03-04 01:40:22,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:22,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:22,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:22,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:22,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:22,062 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:24,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:28,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:31,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:31,844 INFO L93 Difference]: Finished difference Result 270 states and 392 transitions. [2025-03-04 01:40:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:40:31,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 192 [2025-03-04 01:40:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:31,848 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:40:31,848 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:40:31,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:31,849 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 177 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:31,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 573 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2025-03-04 01:40:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:40:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-03-04 01:40:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 109 states have internal predecessors, (146), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions. [2025-03-04 01:40:31,861 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 192 [2025-03-04 01:40:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions. [2025-03-04 01:40:31,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions. [2025-03-04 01:40:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 01:40:31,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:31,864 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:31,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:32,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-04 01:40:32,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:32,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1407289075, now seen corresponding path program 1 times [2025-03-04 01:40:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633077740] [2025-03-04 01:40:32,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:32,066 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-03-04 01:40:32,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:32,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-04 01:40:32,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:32,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 01:40:32,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 01:40:32,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:32,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:32,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:40:32,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:32,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:32,728 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-03-04 01:40:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:40:32,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:32,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633077740] [2025-03-04 01:40:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633077740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716071314] [2025-03-04 01:40:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:32,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:32,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:32,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:32,766 INFO L87 Difference]: Start difference. First operand 136 states and 196 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:33,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:37,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:40,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:40,966 INFO L93 Difference]: Finished difference Result 270 states and 390 transitions. [2025-03-04 01:40:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:40:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 194 [2025-03-04 01:40:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:40,968 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:40:40,968 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:40:40,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:40,969 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 168 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:40,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 569 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-04 01:40:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:40:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-03-04 01:40:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 195 transitions. [2025-03-04 01:40:40,981 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 195 transitions. Word has length 194 [2025-03-04 01:40:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:40,981 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 195 transitions. [2025-03-04 01:40:40,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 195 transitions. [2025-03-04 01:40:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 01:40:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:40,983 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:41,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:41,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-04 01:40:41,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1351969397, now seen corresponding path program 1 times [2025-03-04 01:40:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:41,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864800642] [2025-03-04 01:40:41,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:41,185 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-03-04 01:40:41,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:41,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-04 01:40:41,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:40:41,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:40:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:40:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:41,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:40:41,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:41,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:41,850 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-03-04 01:40:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-03-04 01:40:41,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:41,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864800642] [2025-03-04 01:40:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864800642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:41,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:41,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393112731] [2025-03-04 01:40:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:41,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:41,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:41,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:41,880 INFO L87 Difference]: Start difference. First operand 136 states and 195 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:43,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:46,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:51,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:51,349 INFO L93 Difference]: Finished difference Result 270 states and 388 transitions. [2025-03-04 01:40:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:40:51,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 196 [2025-03-04 01:40:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:51,351 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:40:51,351 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:40:51,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:51,351 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 158 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:51,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 563 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2025-03-04 01:40:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:40:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-03-04 01:40:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 109 states have internal predecessors, (144), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:40:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-03-04 01:40:51,361 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 196 [2025-03-04 01:40:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-03-04 01:40:51,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-03-04 01:40:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 01:40:51,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:51,363 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:51,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:51,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-04 01:40:51,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:51,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 321640179, now seen corresponding path program 1 times [2025-03-04 01:40:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:51,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519562145] [2025-03-04 01:40:51,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:51,565 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-03-04 01:40:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:51,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-04 01:40:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2025-03-04 01:40:51,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 01:40:52,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 01:40:52,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:52,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:40:52,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:52,391 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 97 treesize of output 43 [2025-03-04 01:40:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-03-04 01:40:52,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:52,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519562145] [2025-03-04 01:40:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519562145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170223151] [2025-03-04 01:40:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:52,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:52,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:52,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:52,449 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:40:54,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:58,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:41:02,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:41:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:02,711 INFO L93 Difference]: Finished difference Result 270 states and 386 transitions. [2025-03-04 01:41:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:41:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 198 [2025-03-04 01:41:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:02,716 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:41:02,716 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:41:02,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:41:02,717 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 144 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:02,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 559 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-03-04 01:41:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:41:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-03-04 01:41:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:41:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2025-03-04 01:41:02,722 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 198 [2025-03-04 01:41:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:02,722 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2025-03-04 01:41:02,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:41:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2025-03-04 01:41:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:41:02,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:02,724 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:41:02,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Ended with exit code 0 [2025-03-04 01:41:02,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-03-04 01:41:02,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:02,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:02,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1340402315, now seen corresponding path program 1 times [2025-03-04 01:41:02,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:41:02,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843148924] [2025-03-04 01:41:02,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:02,925 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-03-04 01:41:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:41:02,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-03-04 01:41:02,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Waiting until timeout for monitored process [2025-03-04 01:41:03,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:41:03,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:41:03,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:03,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:03,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:41:03,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:41:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:41:03,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:41:03,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:41:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843148924] [2025-03-04 01:41:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843148924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:41:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675542879] [2025-03-04 01:41:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:03,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:41:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:41:03,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:41:03,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:03,507 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:41:07,512 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-03-04 01:41:11,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:41:12,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:41:14,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:41:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:14,470 INFO L93 Difference]: Finished difference Result 269 states and 383 transitions. [2025-03-04 01:41:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:41:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 200 [2025-03-04 01:41:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:14,473 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:41:14,473 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 01:41:14,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:41:14,474 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:14,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 10.9s Time] [2025-03-04 01:41:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 01:41:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 01:41:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 109 states have internal predecessors, (142), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:41:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2025-03-04 01:41:14,480 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 200 [2025-03-04 01:41:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:14,480 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2025-03-04 01:41:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:41:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2025-03-04 01:41:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:41:14,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:14,483 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:41:14,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Ended with exit code 0 [2025-03-04 01:41:14,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-03-04 01:41:14,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:14,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1211319596, now seen corresponding path program 1 times [2025-03-04 01:41:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:41:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287140366] [2025-03-04 01:41:14,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:14,685 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-03-04 01:41:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:41:14,687 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-03-04 01:41:14,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Waiting until timeout for monitored process [2025-03-04 01:41:14,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.