./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-99.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 0987a1fc3d0eb59d453fd697f85e5129ed09f2056b05af2093f19278b7a9eac6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:04:12,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:04:12,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:04:12,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:04:12,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:04:12,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:04:12,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:04:12,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:04:12,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:04:12,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:04:12,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:04:12,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:04:12,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:04:12,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:04:12,788 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:04:12,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:04:12,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:04:12,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:04:12,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:04:12,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:04:12,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:04:12,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:12,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:04:12,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:04:12,790 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 -> 0987a1fc3d0eb59d453fd697f85e5129ed09f2056b05af2093f19278b7a9eac6 [2025-03-17 06:04:13,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:04:13,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:04:13,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:04:13,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:04:13,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:04:13,018 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-99.i [2025-03-17 06:04:14,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6731552/f681073a0f8a4130bec5d237b8473a98/FLAG0fc74cc89 [2025-03-17 06:04:14,381 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:04:14,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-99.i [2025-03-17 06:04:14,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6731552/f681073a0f8a4130bec5d237b8473a98/FLAG0fc74cc89 [2025-03-17 06:04:14,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6731552/f681073a0f8a4130bec5d237b8473a98 [2025-03-17 06:04:14,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:04:14,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:04:14,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:14,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:04:14,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:04:14,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:14,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67474227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14, skipping insertion in model container [2025-03-17 06:04:14,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:14,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:04:14,842 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-99.i[916,929] [2025-03-17 06:04:14,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:14,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:04:14,918 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-99.i[916,929] [2025-03-17 06:04:14,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:14,982 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:04:14,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14 WrapperNode [2025-03-17 06:04:14,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:14,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:14,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:04:14,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:04:14,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:14,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,032 INFO L138 Inliner]: procedures = 30, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 549 [2025-03-17 06:04:15,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:15,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:04:15,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:04:15,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:04:15,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,049 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:04:15,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:04:15,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:04:15,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:04:15,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:04:15,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (1/1) ... [2025-03-17 06:04:15,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:15,106 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-17 06:04:15,109 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-17 06:04:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:04:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:04:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:04:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:04:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:04:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:04:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:04:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:04:15,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:04:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:04:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:04:15,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:04:15,213 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:04:15,214 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:04:15,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem111#1;havoc property_#t~ite128#1;havoc property_#t~mem118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite141#1;havoc property_#t~mem138#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite163#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite162#1;havoc property_#t~mem159#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite158#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~mem161#1;havoc property_#t~mem160#1;havoc property_#t~short164#1; [2025-03-17 06:04:15,667 INFO L? ?]: Removed 155 outVars from TransFormulas that were not future-live. [2025-03-17 06:04:15,667 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:04:15,675 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:04:15,677 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:04:15,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:15 BoogieIcfgContainer [2025-03-17 06:04:15,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:04:15,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:04:15,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:04:15,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:04:15,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:04:14" (1/3) ... [2025-03-17 06:04:15,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21947e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:15, skipping insertion in model container [2025-03-17 06:04:15,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:14" (2/3) ... [2025-03-17 06:04:15,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21947e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:15, skipping insertion in model container [2025-03-17 06:04:15,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:15" (3/3) ... [2025-03-17 06:04:15,685 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-99.i [2025-03-17 06:04:15,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:04:15,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-99.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:04:15,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:04:15,756 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;@106d32a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:04:15,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:04:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:04:15,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:15,771 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:15,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1735406362, now seen corresponding path program 1 times [2025-03-17 06:04:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386496520] [2025-03-17 06:04:15,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:15,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:15,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:15,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:15,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 06:04:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386496520] [2025-03-17 06:04:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386496520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016418367] [2025-03-17 06:04:16,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:16,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:16,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:16,091 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-17 06:04:16,093 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-17 06:04:16,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:16,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:16,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:16,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:04:16,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 06:04:16,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016418367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:04:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:04:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188464402] [2025-03-17 06:04:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:04:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:16,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:04:16,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:16,366 INFO L87 Difference]: Start difference. First operand has 119 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:16,387 INFO L93 Difference]: Finished difference Result 235 states and 371 transitions. [2025-03-17 06:04:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:04:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-17 06:04:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:16,392 INFO L225 Difference]: With dead ends: 235 [2025-03-17 06:04:16,392 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 06:04:16,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-17 06:04:16,396 INFO L435 NwaCegarLoop]: 173 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, 173 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-17 06:04:16,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 06:04:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 06:04:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-17 06:04:16,429 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 152 [2025-03-17 06:04:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-17 06:04:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-17 06:04:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:04:16,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:16,431 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:16,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:04:16,632 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-17 06:04:16,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:16,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash 107352157, now seen corresponding path program 1 times [2025-03-17 06:04:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893294893] [2025-03-17 06:04:16,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:16,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:16,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:16,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:04:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893294893] [2025-03-17 06:04:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893294893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:16,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:04:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278579539] [2025-03-17 06:04:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:16,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:04:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:16,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:04:16,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:04:16,937 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:16,978 INFO L93 Difference]: Finished difference Result 235 states and 348 transitions. [2025-03-17 06:04:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:04:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-17 06:04:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:16,982 INFO L225 Difference]: With dead ends: 235 [2025-03-17 06:04:16,983 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 06:04:16,984 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-17 06:04:16,985 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 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-17 06:04:16,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 06:04:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 06:04:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2025-03-17 06:04:17,003 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 152 [2025-03-17 06:04:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:17,004 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2025-03-17 06:04:17,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2025-03-17 06:04:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:04:17,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:17,006 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:17,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:04:17,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:17,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1493813890, now seen corresponding path program 1 times [2025-03-17 06:04:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049180370] [2025-03-17 06:04:17,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:17,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:17,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:17,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:04:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049180370] [2025-03-17 06:04:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049180370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:04:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748478484] [2025-03-17 06:04:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:18,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:18,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:18,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:18,954 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:19,391 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2025-03-17 06:04:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:04:19,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-17 06:04:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:19,393 INFO L225 Difference]: With dead ends: 273 [2025-03-17 06:04:19,394 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 06:04:19,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:04:19,395 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 45 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:19,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 520 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:04:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 06:04:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2025-03-17 06:04:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 191 transitions. [2025-03-17 06:04:19,408 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 191 transitions. Word has length 152 [2025-03-17 06:04:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 191 transitions. [2025-03-17 06:04:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 191 transitions. [2025-03-17 06:04:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:04:19,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:19,410 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:19,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:04:19,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1399562815, now seen corresponding path program 1 times [2025-03-17 06:04:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154275848] [2025-03-17 06:04:19,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:19,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:19,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:19,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:19,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 06:04:19,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154275848] [2025-03-17 06:04:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154275848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298965790] [2025-03-17 06:04:19,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:19,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:19,605 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-17 06:04:19,606 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-17 06:04:19,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:19,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:19,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:19,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:19,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:04:19,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:04:19,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298965790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:19,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:04:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 06:04:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992079126] [2025-03-17 06:04:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:19,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:04:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:19,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:04:19,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:04:19,879 INFO L87 Difference]: Start difference. First operand 130 states and 191 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:04:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:19,913 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2025-03-17 06:04:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:04:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-17 06:04:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:19,916 INFO L225 Difference]: With dead ends: 262 [2025-03-17 06:04:19,918 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 06:04:19,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:04:19,919 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:19,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 06:04:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 06:04:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2025-03-17 06:04:19,931 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 152 [2025-03-17 06:04:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:19,932 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2025-03-17 06:04:19,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:04:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2025-03-17 06:04:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:04:19,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:19,933 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:19,941 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-17 06:04:20,137 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,SelfDestructingSolverStorable3 [2025-03-17 06:04:20,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:20,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash 372642126, now seen corresponding path program 1 times [2025-03-17 06:04:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:20,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905288549] [2025-03-17 06:04:20,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:20,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:04:20,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:04:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:04:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889583612] [2025-03-17 06:04:20,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:20,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:04:20,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:04:20,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:04:20,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:04:20,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:20,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:04:20,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:04:20,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:04:21,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:04:21,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:21,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:04:21,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:04:21,629 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:04:21,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:04:21,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:04:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:21,838 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 06:04:21,880 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:04:21,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:04:21 BoogieIcfgContainer [2025-03-17 06:04:21,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:04:21,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:04:21,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:04:21,884 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:04:21,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:15" (3/4) ... [2025-03-17 06:04:21,887 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:04:21,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:04:21,888 INFO L158 Benchmark]: Toolchain (without parser) took 7178.99ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 112.0MB in the beginning and 253.3MB in the end (delta: -141.3MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2025-03-17 06:04:21,889 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:21,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.77ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 94.0MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:04:21,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 90.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:21,889 INFO L158 Benchmark]: Boogie Preprocessor took 44.52ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 87.5MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:04:21,890 INFO L158 Benchmark]: IcfgBuilder took 599.12ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 54.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:04:21,890 INFO L158 Benchmark]: TraceAbstraction took 6204.46ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 53.0MB in the beginning and 253.4MB in the end (delta: -200.4MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-17 06:04:21,890 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 385.9MB. Free memory was 253.4MB in the beginning and 253.3MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:21,891 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.77ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 94.0MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 90.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.52ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 87.5MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 599.12ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 54.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6204.46ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 53.0MB in the beginning and 253.4MB in the end (delta: -200.4MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 385.9MB. Free memory was 253.4MB in the beginning and 253.3MB in the end (delta: 120.0kB). 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 someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 255.5, 16, 1000000000000000.6, 500.5, 99999999999.5, 1, 127.25, 4.8, 0.4, 0, 256, 25, -5, 2, -50 }; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L85] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_4 [L89] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_4 [L89] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L91] EXPR WrapperStruct00.var_1_5 [L91] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_5 [L91] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_6 [L93] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_6 [L93] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR (WrapperStruct00.var_1_6 >= 0.0F && 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] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && 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] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && 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] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_long() [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] WrapperStruct00.var_1_16 = __VERIFIER_nondet_long() [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=8] [L61] COND TRUE (((((200) < (128)) ? (200) : (128))) - WrapperStruct00.var_1_2) > stepLocal_0 [L62] EXPR WrapperStruct00.var_1_4 [L62] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) [L62] EXPR WrapperStruct00.var_1_4 [L62] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR WrapperStruct00.var_1_6 [L62] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))) - WrapperStruct00.var_1_6) [L68] EXPR WrapperStruct00.var_1_5 [L68] EXPR WrapperStruct00.var_1_6 [L68] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND FALSE !((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) == WrapperStruct00.var_1_1) [L71] EXPR WrapperStruct00.var_1_13 [L71] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_13 [L73] EXPR WrapperStruct00.var_1_12 [L73] EXPR WrapperStruct00.var_1_15 [L73] signed long int stepLocal_1 = WrapperStruct00.var_1_12 % WrapperStruct00.var_1_15; [L74] EXPR WrapperStruct00.var_1_9 [L74] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-1] [L74] COND TRUE WrapperStruct00.var_1_9 == WrapperStruct00.var_1_4 [L75] EXPR WrapperStruct00.var_1_13 [L75] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_13 [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((((200) < (128)) ? (200) : (128))) - WrapperStruct00.var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))) - WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10))) : 1) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR ((((((200) < (128)) ? (200) : (128))) - WrapperStruct00.var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))) - WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((((200) < (128)) ? (200) : (128))) - WrapperStruct00.var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))) - WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10))) : 1)) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) == WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed long int) (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((((((200) < (128)) ? (200) : (128))) - WrapperStruct00.var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))) - WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10))) : 1)) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) == WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed long int) (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_13)) : (((WrapperStruct00.var_1_12 % WrapperStruct00.var_1_15) != WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_2) + WrapperStruct00.var_1_16)) > (WrapperStruct00.var_1_13)) ? (((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_2) + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return ((((((((200) < (128)) ? (200) : (128))) - WrapperStruct00.var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))) - WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((float) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10))) : 1)) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) == WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed long int) (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((signed long int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_13)) : (((WrapperStruct00.var_1_12 % WrapperStruct00.var_1_15) != WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_2) + WrapperStruct00.var_1_16)) > (WrapperStruct00.var_1_13)) ? (((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_2) + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 196 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 1860 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1213 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 647 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1218 NumberOfCodeBlocks, 1218 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1071 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 4014/4104 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-17 06:04:21,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-99.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 0987a1fc3d0eb59d453fd697f85e5129ed09f2056b05af2093f19278b7a9eac6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:04:23,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:04:23,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:04:23,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:04:23,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:04:23,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:04:23,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:04:23,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:04:23,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:04:23,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:04:23,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:04:23,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:04:23,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:04:23,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:04:23,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:04:23,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:04:23,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:23,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:04:23,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:04:23,995 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 -> 0987a1fc3d0eb59d453fd697f85e5129ed09f2056b05af2093f19278b7a9eac6 [2025-03-17 06:04:24,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:04:24,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:04:24,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:04:24,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:04:24,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:04:24,265 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-99.i [2025-03-17 06:04:25,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f8d076c/7b8312a105b64a729feb0fb79bdaef31/FLAGba02b32ab [2025-03-17 06:04:25,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:04:25,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-99.i [2025-03-17 06:04:25,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f8d076c/7b8312a105b64a729feb0fb79bdaef31/FLAGba02b32ab [2025-03-17 06:04:25,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f8d076c/7b8312a105b64a729feb0fb79bdaef31 [2025-03-17 06:04:25,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:04:25,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:04:25,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:25,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:04:25,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:04:25,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d84f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:25, skipping insertion in model container [2025-03-17 06:04:25,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:25" (1/1) ... [2025-03-17 06:04:25,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:04:25,876 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-99.i[916,929] [2025-03-17 06:04:25,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:25,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:04:25,973 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-99.i[916,929] [2025-03-17 06:04:26,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:26,036 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:04:26,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26 WrapperNode [2025-03-17 06:04:26,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:26,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:26,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:04:26,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:04:26,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,094 INFO L138 Inliner]: procedures = 37, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2025-03-17 06:04:26,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:26,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:04:26,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:04:26,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:04:26,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,120 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-17 06:04:26,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:04:26,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:04:26,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:04:26,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:04:26,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (1/1) ... [2025-03-17 06:04:26,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:26,177 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-17 06:04:26,179 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-17 06:04:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:04:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:04:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:04:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:04:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:04:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:04:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:04:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:04:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:04:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:04:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:04:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:04:26,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:04:26,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:04:26,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:04:26,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:04:26,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:04:26,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:04:28,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem111#1;havoc property_#t~ite128#1;havoc property_#t~mem118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite141#1;havoc property_#t~mem138#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite163#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite162#1;havoc property_#t~mem159#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite158#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~mem161#1;havoc property_#t~mem160#1;havoc property_#t~short164#1; [2025-03-17 06:04:28,125 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2025-03-17 06:04:28,125 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:04:28,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:04:28,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:04:28,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:28 BoogieIcfgContainer [2025-03-17 06:04:28,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:04:28,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:04:28,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:04:28,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:04:28,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:04:25" (1/3) ... [2025-03-17 06:04:28,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72017f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:28, skipping insertion in model container [2025-03-17 06:04:28,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:26" (2/3) ... [2025-03-17 06:04:28,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72017f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:28, skipping insertion in model container [2025-03-17 06:04:28,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:28" (3/3) ... [2025-03-17 06:04:28,148 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-99.i [2025-03-17 06:04:28,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:04:28,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-99.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:04:28,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:04:28,223 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;@2a7658c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:04:28,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:04:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:04:28,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:28,238 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:28,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:28,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1835293009, now seen corresponding path program 1 times [2025-03-17 06:04:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068091785] [2025-03-17 06:04:28,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:28,252 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-17 06:04:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:28,255 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-17 06:04:28,256 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-17 06:04:28,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:28,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:04:28,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-17 06:04:28,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:28,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:28,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068091785] [2025-03-17 06:04:28,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068091785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:28,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:28,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:04:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662040374] [2025-03-17 06:04:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:28,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:04:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:28,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:04:28,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:28,771 INFO L87 Difference]: Start difference. First operand has 119 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:28,791 INFO L93 Difference]: Finished difference Result 235 states and 371 transitions. [2025-03-17 06:04:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:04:28,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-17 06:04:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:28,800 INFO L225 Difference]: With dead ends: 235 [2025-03-17 06:04:28,801 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 06:04:28,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-17 06:04:28,806 INFO L435 NwaCegarLoop]: 173 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, 173 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-17 06:04:28,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 06:04:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 06:04:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-17 06:04:28,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 152 [2025-03-17 06:04:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:28,847 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-17 06:04:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-17 06:04:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:04:28,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:28,850 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:28,866 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-17 06:04:29,050 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-17 06:04:29,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 7465510, now seen corresponding path program 1 times [2025-03-17 06:04:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936230188] [2025-03-17 06:04:29,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:29,053 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-17 06:04:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:29,057 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-17 06:04:29,058 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-17 06:04:29,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:04:29,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:04:29,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:29,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:29,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:29,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:29,598 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 95 treesize of output 41 [2025-03-17 06:04:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-17 06:04:29,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:29,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936230188] [2025-03-17 06:04:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936230188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:29,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:29,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110805430] [2025-03-17 06:04:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:29,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:29,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:29,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:29,630 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:31,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:04:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:32,201 INFO L93 Difference]: Finished difference Result 234 states and 346 transitions. [2025-03-17 06:04:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:04:32,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-17 06:04:32,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:32,204 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:04:32,204 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:04:32,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 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-17 06:04:32,206 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 162 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:32,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 462 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 06:04:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:04:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:04:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2025-03-17 06:04:32,221 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 152 [2025-03-17 06:04:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2025-03-17 06:04:32,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2025-03-17 06:04:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:04:32,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:32,227 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:32,243 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-17 06:04:32,428 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-17 06:04:32,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 768449512, now seen corresponding path program 1 times [2025-03-17 06:04:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505389556] [2025-03-17 06:04:32,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:32,429 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-17 06:04:32,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:32,431 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-17 06:04:32,432 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-17 06:04:32,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:04:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:04:32,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:32,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:32,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:32,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:32,935 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 95 treesize of output 41 [2025-03-17 06:04:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-03-17 06:04:32,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:32,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505389556] [2025-03-17 06:04:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505389556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:32,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47945197] [2025-03-17 06:04:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:32,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:32,963 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:34,929 INFO L93 Difference]: Finished difference Result 234 states and 344 transitions. [2025-03-17 06:04:34,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:04:34,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-17 06:04:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:34,932 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:04:34,933 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:04:34,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 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-17 06:04:34,934 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 153 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:34,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 458 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 06:04:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:04:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:04:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-03-17 06:04:34,947 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 154 [2025-03-17 06:04:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:34,948 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-03-17 06:04:34,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-03-17 06:04:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:04:34,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:34,953 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:34,966 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-17 06:04:35,153 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-17 06:04:35,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:35,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2052686938, now seen corresponding path program 1 times [2025-03-17 06:04:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:35,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092156607] [2025-03-17 06:04:35,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:35,155 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-17 06:04:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:35,158 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-17 06:04:35,159 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-17 06:04:35,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:04:35,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:04:35,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:35,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:35,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:35,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:35,629 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 95 treesize of output 41 [2025-03-17 06:04:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 06:04:35,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:35,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:35,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092156607] [2025-03-17 06:04:35,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092156607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:35,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:35,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40979051] [2025-03-17 06:04:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:35,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:35,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:35,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:35,667 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:37,263 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2025-03-17 06:04:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:04:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2025-03-17 06:04:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:37,265 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:04:37,265 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:04:37,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 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-17 06:04:37,266 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:37,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 454 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 06:04:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:04:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:04:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-17 06:04:37,276 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 156 [2025-03-17 06:04:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:37,277 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-17 06:04:37,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:04:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-17 06:04:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:04:37,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:37,278 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:37,295 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-17 06:04:37,479 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-17 06:04:37,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1791022232, now seen corresponding path program 1 times [2025-03-17 06:04:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107612213] [2025-03-17 06:04:37,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:37,481 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-17 06:04:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:37,484 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-17 06:04:37,485 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-17 06:04:37,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:04:38,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:04:38,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:38,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:38,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 06:04:38,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:38,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:04:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:38,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-03-17 06:04:38,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:38,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 06:04:38,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:38,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2025-03-17 06:04:38,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:38,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 67 [2025-03-17 06:04:39,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:39,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 29 [2025-03-17 06:04:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 328 proven. 51 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-17 06:04:39,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:04:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:04:39,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107612213] [2025-03-17 06:04:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107612213] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:39,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:04:39,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2025-03-17 06:04:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125720178] [2025-03-17 06:04:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:04:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:04:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:04:39,362 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:04:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:40,996 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2025-03-17 06:04:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:04:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-17 06:04:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:40,997 INFO L225 Difference]: With dead ends: 269 [2025-03-17 06:04:40,998 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 06:04:40,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:04:40,998 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 90 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:40,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 343 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 06:04:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 06:04:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2025-03-17 06:04:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-03-17 06:04:41,005 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 158 [2025-03-17 06:04:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:41,005 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-03-17 06:04:41,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:04:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-03-17 06:04:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 06:04:41,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:41,007 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:41,021 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-17 06:04:41,207 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-17 06:04:41,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:41,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1696771157, now seen corresponding path program 1 times [2025-03-17 06:04:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965730114] [2025-03-17 06:04:41,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:41,208 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-17 06:04:41,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:41,211 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-17 06:04:41,211 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-17 06:04:41,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 06:04:41,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 06:04:41,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:41,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:41,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:04:41,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 06:04:41,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:41,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965730114] [2025-03-17 06:04:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965730114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315365370] [2025-03-17 06:04:41,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:41,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:04:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:41,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:04:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:04:41,552 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:04:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:41,640 INFO L93 Difference]: Finished difference Result 258 states and 375 transitions. [2025-03-17 06:04:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:04:41,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-03-17 06:04:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:41,643 INFO L225 Difference]: With dead ends: 258 [2025-03-17 06:04:41,643 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 06:04:41,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:04:41,644 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:41,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:04:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 06:04:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 06:04:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2025-03-17 06:04:41,650 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 158 [2025-03-17 06:04:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:41,651 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2025-03-17 06:04:41,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 06:04:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2025-03-17 06:04:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:04:41,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:41,652 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:04:41,664 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 (7)] Ended with exit code 0 [2025-03-17 06:04:41,852 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-17 06:04:41,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:41,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -250881880, now seen corresponding path program 1 times [2025-03-17 06:04:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116624730] [2025-03-17 06:04:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:41,853 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-17 06:04:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:41,855 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-17 06:04:41,857 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-17 06:04:41,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:04:42,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:04:42,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:42,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:42,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 06:04:42,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:42,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 06:04:42,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2025-03-17 06:04:43,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2025-03-17 06:04:43,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2025-03-17 06:04:43,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2025-03-17 06:04:43,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2025-03-17 06:04:43,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:43,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 53 [2025-03-17 06:04:43,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:43,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 53 [2025-03-17 06:04:43,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:43,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 53 [2025-03-17 06:04:43,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:43,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 63 [2025-03-17 06:04:44,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:44,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 66 [2025-03-17 06:04:44,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:44,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 66 [2025-03-17 06:04:44,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:44,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 84 [2025-03-17 06:04:44,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:44,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 60 [2025-03-17 06:04:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 173 proven. 367 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 06:04:44,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:04:45,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116624730] [2025-03-17 06:04:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116624730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1507154435] [2025-03-17 06:04:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:45,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:04:45,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:04:45,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:04:45,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 06:04:45,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:04:47,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:04:47,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:47,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:47,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 06:04:47,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:47,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:04:49,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2025-03-17 06:04:49,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2025-03-17 06:04:49,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 38 [2025-03-17 06:04:50,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:50,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2025-03-17 06:04:50,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2025-03-17 06:04:51,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:51,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 72 [2025-03-17 06:04:52,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:52,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 72 [2025-03-17 06:04:52,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:52,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 72 [2025-03-17 06:04:52,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:52,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 80 [2025-03-17 06:04:53,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:53,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 83 [2025-03-17 06:04:53,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:53,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 83 [2025-03-17 06:04:53,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:53,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 126 treesize of output 97 [2025-03-17 06:04:54,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:54,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 164 treesize of output 76 [2025-03-17 06:04:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 197 proven. 367 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 06:04:54,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:04:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1507154435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:54,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:04:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 36 [2025-03-17 06:04:54,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953186389] [2025-03-17 06:04:54,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:04:54,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 06:04:54,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:54,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 06:04:54,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1678, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 06:04:54,716 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 37 states, 35 states have (on average 4.257142857142857) internal successors, (149), 34 states have internal predecessors, (149), 11 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 9 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-17 06:05:02,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:04,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:07,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:09,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:05:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:35,737 INFO L93 Difference]: Finished difference Result 683 states and 968 transitions. [2025-03-17 06:05:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-17 06:05:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 4.257142857142857) internal successors, (149), 34 states have internal predecessors, (149), 11 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 9 states have call predecessors, (38), 11 states have call successors, (38) Word has length 159 [2025-03-17 06:05:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:35,743 INFO L225 Difference]: With dead ends: 683 [2025-03-17 06:05:35,743 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 06:05:35,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 385 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=893, Invalid=3799, Unknown=0, NotChecked=0, Total=4692 [2025-03-17 06:05:35,745 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1355 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:35,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 1187 Invalid, 3972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [293 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 37.2s Time] [2025-03-17 06:05:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 06:05:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 410. [2025-03-17 06:05:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 352 states have internal predecessors, (474), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 06:05:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 580 transitions. [2025-03-17 06:05:35,788 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 580 transitions. Word has length 159 [2025-03-17 06:05:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 580 transitions. [2025-03-17 06:05:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 4.257142857142857) internal successors, (149), 34 states have internal predecessors, (149), 11 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 9 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-17 06:05:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 580 transitions. [2025-03-17 06:05:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:05:35,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:35,791 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:05:35,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-17 06:05:36,008 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-17 06:05:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 06:05:36,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1221172887, now seen corresponding path program 1 times [2025-03-17 06:05:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:05:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26932913] [2025-03-17 06:05:36,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:36,193 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-17 06:05:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:05:36,195 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-17 06:05:36,196 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-17 06:05:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:05:36,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:05:36,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:36,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:05:36,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-17 06:05:36,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:36,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:05:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26932913] [2025-03-17 06:05:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26932913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:05:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336414029] [2025-03-17 06:05:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:36,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:05:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:05:36,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:05:36,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:05:36,613 INFO L87 Difference]: Start difference. First operand 410 states and 580 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:05:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:36,666 INFO L93 Difference]: Finished difference Result 821 states and 1162 transitions. [2025-03-17 06:05:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 159 [2025-03-17 06:05:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:36,671 INFO L225 Difference]: With dead ends: 821 [2025-03-17 06:05:36,671 INFO L226 Difference]: Without dead ends: 412 [2025-03-17 06:05:36,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 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-17 06:05:36,672 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:36,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-17 06:05:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-17 06:05:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 351 states have (on average 1.3532763532763532) internal successors, (475), 354 states have internal predecessors, (475), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 06:05:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 581 transitions. [2025-03-17 06:05:36,704 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 581 transitions. Word has length 159 [2025-03-17 06:05:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:36,704 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 581 transitions. [2025-03-17 06:05:36,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 06:05:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 581 transitions. [2025-03-17 06:05:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:05:36,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:36,706 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:05:36,721 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 (10)] Forceful destruction successful, exit code 0 [2025-03-17 06:05:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-17 06:05:36,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1626387015, now seen corresponding path program 1 times [2025-03-17 06:05:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:05:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210514641] [2025-03-17 06:05:36,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:36,908 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-17 06:05:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:05:36,912 INFO L229 MonitoredProcess]: Starting monitored process 11 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-17 06:05:36,913 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 (11)] Waiting until timeout for monitored process [2025-03-17 06:05:37,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:05:37,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:05:37,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:37,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:05:37,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-17 06:05:37,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:37,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:05:37,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210514641] [2025-03-17 06:05:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210514641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:37,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:05:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890461291] [2025-03-17 06:05:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:05:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:05:37,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:05:37,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:05:37,336 INFO L87 Difference]: Start difference. First operand 412 states and 581 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:05:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:37,511 INFO L93 Difference]: Finished difference Result 833 states and 1172 transitions. [2025-03-17 06:05:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:05:37,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 159 [2025-03-17 06:05:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:37,515 INFO L225 Difference]: With dead ends: 833 [2025-03-17 06:05:37,515 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 06:05:37,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:37,518 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:37,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 696 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:05:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 06:05:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 412. [2025-03-17 06:05:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 351 states have (on average 1.3475783475783476) internal successors, (473), 354 states have internal predecessors, (473), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 06:05:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 579 transitions. [2025-03-17 06:05:37,549 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 579 transitions. Word has length 159 [2025-03-17 06:05:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:37,550 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 579 transitions. [2025-03-17 06:05:37,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 06:05:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 579 transitions. [2025-03-17 06:05:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:05:37,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:37,551 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:05:37,566 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 (11)] Forceful destruction successful, exit code 0 [2025-03-17 06:05:37,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-17 06:05:37,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 697607849, now seen corresponding path program 1 times [2025-03-17 06:05:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:05:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760385717] [2025-03-17 06:05:37,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:37,753 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-17 06:05:37,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:05:37,755 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 06:05:37,756 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 (12)] Waiting until timeout for monitored process [2025-03-17 06:05:37,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:05:38,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:05:38,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:38,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:38,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:05:38,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:38,221 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 94 treesize of output 40 [2025-03-17 06:05:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-17 06:05:38,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:05:38,417 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 58 treesize of output 22 [2025-03-17 06:05:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 06:05:38,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:05:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760385717] [2025-03-17 06:05:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760385717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:05:38,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:05:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-17 06:05:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971162519] [2025-03-17 06:05:38,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:05:38,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:05:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:05:38,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:05:38,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:05:38,428 INFO L87 Difference]: Start difference. First operand 412 states and 579 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2025-03-17 06:05:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:41,994 INFO L93 Difference]: Finished difference Result 710 states and 987 transitions. [2025-03-17 06:05:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:05:41,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 159 [2025-03-17 06:05:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:41,997 INFO L225 Difference]: With dead ends: 710 [2025-03-17 06:05:41,997 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 06:05:41,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:05:41,998 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 147 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:41,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 780 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 06:05:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 06:05:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 284. [2025-03-17 06:05:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 243 states have (on average 1.337448559670782) internal successors, (325), 245 states have internal predecessors, (325), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:05:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 393 transitions. [2025-03-17 06:05:42,015 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 393 transitions. Word has length 159 [2025-03-17 06:05:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:42,016 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 393 transitions. [2025-03-17 06:05:42,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2025-03-17 06:05:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 393 transitions. [2025-03-17 06:05:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 06:05:42,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:42,018 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:05:42,035 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 (12)] Ended with exit code 0 [2025-03-17 06:05:42,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-17 06:05:42,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 335336584, now seen corresponding path program 1 times [2025-03-17 06:05:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:05:42,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982080553] [2025-03-17 06:05:42,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:42,221 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-17 06:05:42,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:05:42,223 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 06:05:42,225 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 (13)] Waiting until timeout for monitored process [2025-03-17 06:05:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.