./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2b5980e1479d314973e22beecd1bd5f4f4b295fb19f9db6b2f7cc86f57a089b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:56:06,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:56:06,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:56:06,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:56:06,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:56:06,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:56:06,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:56:06,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:56:06,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:56:06,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:56:06,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:56:06,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:56:06,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:56:06,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:06,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:56:06,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:56:06,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2b5980e1479d314973e22beecd1bd5f4f4b295fb19f9db6b2f7cc86f57a089b [2025-02-06 03:56:07,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:56:07,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:56:07,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:56:07,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:56:07,207 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:56:07,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i [2025-02-06 03:56:08,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc716a456/9b7b9bef154f489a9954f19532c9f6ec/FLAG6c8d51e1a [2025-02-06 03:56:08,744 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:56:08,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i [2025-02-06 03:56:08,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc716a456/9b7b9bef154f489a9954f19532c9f6ec/FLAG6c8d51e1a [2025-02-06 03:56:08,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc716a456/9b7b9bef154f489a9954f19532c9f6ec [2025-02-06 03:56:08,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:56:08,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:56:08,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:08,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:56:08,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:56:08,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:08" (1/1) ... [2025-02-06 03:56:08,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4017ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:08, skipping insertion in model container [2025-02-06 03:56:08,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:08" (1/1) ... [2025-02-06 03:56:08,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:56:08,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i[916,929] [2025-02-06 03:56:08,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:08,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:56:09,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i[916,929] [2025-02-06 03:56:09,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:09,037 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:56:09,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09 WrapperNode [2025-02-06 03:56:09,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:09,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:09,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:56:09,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:56:09,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,079 INFO L138 Inliner]: procedures = 30, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 621 [2025-02-06 03:56:09,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:09,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:56:09,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:56:09,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:56:09,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,104 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:56:09,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:56:09,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:56:09,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:56:09,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:56:09,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (1/1) ... [2025-02-06 03:56:09,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:09,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:56:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:56:09,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:56:09,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:56:09,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:56:09,283 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:56:09,284 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:56:09,761 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem138#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite161#1;havoc property_#t~mem146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~ite150#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~ite158#1;havoc property_#t~mem157#1;havoc property_#t~mem156#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~short162#1;havoc property_#t~mem169#1;havoc property_#t~mem168#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite180#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~short172#1;havoc property_#t~ite177#1;havoc property_#t~mem174#1;havoc property_#t~mem173#1;havoc property_#t~mem176#1;havoc property_#t~mem175#1;havoc property_#t~mem179#1;havoc property_#t~mem178#1;havoc property_#t~short181#1; [2025-02-06 03:56:09,798 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-02-06 03:56:09,798 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:56:09,806 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:56:09,806 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:56:09,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:09 BoogieIcfgContainer [2025-02-06 03:56:09,807 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:56:09,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:56:09,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:56:09,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:56:09,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:56:08" (1/3) ... [2025-02-06 03:56:09,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df17aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:09, skipping insertion in model container [2025-02-06 03:56:09,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:09" (2/3) ... [2025-02-06 03:56:09,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df17aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:09, skipping insertion in model container [2025-02-06 03:56:09,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:09" (3/3) ... [2025-02-06 03:56:09,813 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-77.i [2025-02-06 03:56:09,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:56:09,824 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-77.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:56:09,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:56:09,864 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;@66556eec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:56:09,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:56:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:56:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:09,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:09,875 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:09,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 780695579, now seen corresponding path program 1 times [2025-02-06 03:56:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:09,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779326299] [2025-02-06 03:56:09,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:09,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:10,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:10,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:56:10,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:10,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779326299] [2025-02-06 03:56:10,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779326299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:10,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010350255] [2025-02-06 03:56:10,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:10,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:10,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:56:10,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:10,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:10,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:10,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:56:10,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:56:10,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010350255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:10,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:56:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822914502] [2025-02-06 03:56:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:10,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:56:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:10,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:56:10,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:56:10,380 INFO L87 Difference]: Start difference. First operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:56:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:10,410 INFO L93 Difference]: Finished difference Result 252 states and 397 transitions. [2025-02-06 03:56:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:56:10,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-02-06 03:56:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:10,415 INFO L225 Difference]: With dead ends: 252 [2025-02-06 03:56:10,416 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 03:56:10,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-02-06 03:56:10,419 INFO L435 NwaCegarLoop]: 187 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, 187 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-02-06 03:56:10,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 03:56:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-06 03:56:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:56:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2025-02-06 03:56:10,454 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 187 transitions. Word has length 151 [2025-02-06 03:56:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:10,454 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 187 transitions. [2025-02-06 03:56:10,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:56:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 187 transitions. [2025-02-06 03:56:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:10,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:10,463 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:10,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:56:10,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:56:10,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1826528537, now seen corresponding path program 1 times [2025-02-06 03:56:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785645312] [2025-02-06 03:56:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:10,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:10,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:10,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:56:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785645312] [2025-02-06 03:56:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785645312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681804379] [2025-02-06 03:56:11,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:11,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:11,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:56:11,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:11,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:11,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:11,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:11,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:56:11,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:56:11,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:11,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681804379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:11,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:56:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039120991] [2025-02-06 03:56:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:11,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:11,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:11,408 INFO L87 Difference]: Start difference. First operand 126 states and 187 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:56:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:11,434 INFO L93 Difference]: Finished difference Result 251 states and 374 transitions. [2025-02-06 03:56:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-02-06 03:56:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:11,436 INFO L225 Difference]: With dead ends: 251 [2025-02-06 03:56:11,436 INFO L226 Difference]: Without dead ends: 128 [2025-02-06 03:56:11,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:11,437 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 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-02-06 03:56:11,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-06 03:56:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-06 03:56:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:56:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2025-02-06 03:56:11,452 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 151 [2025-02-06 03:56:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2025-02-06 03:56:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:56:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2025-02-06 03:56:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:56:11,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:11,455 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:11,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:11,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 182995575, now seen corresponding path program 1 times [2025-02-06 03:56:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050375627] [2025-02-06 03:56:11,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:11,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:11,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:11,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:56:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050375627] [2025-02-06 03:56:13,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050375627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:13,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757311049] [2025-02-06 03:56:13,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:13,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:13,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:13,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:13,862 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:56:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:14,582 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2025-02-06 03:56:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-02-06 03:56:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:14,584 INFO L225 Difference]: With dead ends: 315 [2025-02-06 03:56:14,584 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 03:56:14,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:14,585 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:14,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 554 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:56:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 03:56:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-02-06 03:56:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.4329268292682926) internal successors, (235), 165 states have internal predecessors, (235), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:56:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2025-02-06 03:56:14,596 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 153 [2025-02-06 03:56:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2025-02-06 03:56:14,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:56:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2025-02-06 03:56:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:56:14,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:14,598 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:14,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:56:14,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -814076778, now seen corresponding path program 1 times [2025-02-06 03:56:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036613458] [2025-02-06 03:56:14,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:14,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:14,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:56:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700650847] [2025-02-06 03:56:14,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:14,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:56:14,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:56:14,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:15,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:15,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:15,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:56:15,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:56:15,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:16,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:16,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:16,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:56:16,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:56:16,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:56:16,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:56:16,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:56:17,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:17,041 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:56:17,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:56:17,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:56:17 BoogieIcfgContainer [2025-02-06 03:56:17,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:56:17,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:56:17,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:56:17,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:56:17,091 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:09" (3/4) ... [2025-02-06 03:56:17,092 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:56:17,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:56:17,094 INFO L158 Benchmark]: Toolchain (without parser) took 8304.81ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 125.2MB in the beginning and 390.6MB in the end (delta: -265.5MB). Peak memory consumption was 253.2MB. Max. memory is 16.1GB. [2025-02-06 03:56:17,094 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:56:17,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 106.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:56:17,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.62ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 102.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:56:17,094 INFO L158 Benchmark]: Boogie Preprocessor took 54.31ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 98.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:56:17,095 INFO L158 Benchmark]: IcfgBuilder took 671.91ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 60.2MB in the end (delta: 38.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:56:17,095 INFO L158 Benchmark]: TraceAbstraction took 7268.10ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 59.4MB in the beginning and 143.5MB in the end (delta: -84.1MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. [2025-02-06 03:56:17,095 INFO L158 Benchmark]: Witness Printer took 16.27ms. Allocated memory is still 436.2MB. Free memory was 143.5MB in the beginning and 390.6MB in the end (delta: -247.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2025-02-06 03:56:17,096 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.30ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 106.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.62ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 102.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.31ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 98.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 671.91ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 60.2MB in the end (delta: 38.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7268.10ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 59.4MB in the beginning and 143.5MB in the end (delta: -84.1MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. * Witness Printer took 16.27ms. Allocated memory is still 436.2MB. Free memory was 143.5MB in the beginning and 390.6MB in the end (delta: -247.1MB). Peak memory consumption was 8.7MB. 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 106, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 50, 60871, 1, 28896, 5, 63.8, 49.5, 31.875, 255.25, 0.0, -8, 10000000000000.375, 4, 1, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L87] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) 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 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32767) 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_6 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] 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] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) 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_7 <= 16383) 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 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+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 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+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 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+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 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_15 [L108] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_15 [L108] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) 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_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) 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_17 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) 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_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) 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_18 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] EXPR WrapperStruct00.var_1_7 [L60] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND TRUE WrapperStruct00.var_1_7 > WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L61] EXPR WrapperStruct00.var_1_9 [L61] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L61] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) [L65] EXPR WrapperStruct00.var_1_6 [L65] unsigned short int stepLocal_0 = WrapperStruct00.var_1_6; [L66] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-43335] [L66] COND FALSE !(stepLocal_0 <= WrapperStruct00.var_1_5) [L71] EXPR WrapperStruct00.var_1_7 [L71] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_6 [L73] EXPR WrapperStruct00.var_1_13 [L73] EXPR WrapperStruct00.var_1_5 [L73] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] EXPR ((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7) [L73] EXPR WrapperStruct00.var_1_7 [L73] EXPR ((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1] [L73] COND FALSE !(WrapperStruct00.var_1_6 > (WrapperStruct00.var_1_13 * ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7))))) [L80] EXPR WrapperStruct00.var_1_6 [L80] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_6 [L82] EXPR WrapperStruct00.var_1_8 [L82] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] COND FALSE !(WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))))))) : 1 [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR ((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))))))) : 1) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))) - (WrapperStruct00.var_1_12 - 3.4f))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))))))) : 1) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))) - (WrapperStruct00.var_1_12 - 3.4f)))))) && ((WrapperStruct00.var_1_6 <= WrapperStruct00.var_1_5) ? ((((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_12 / WrapperStruct00.var_1_15))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_12 / WrapperStruct00.var_1_15)))) > ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))))))) : 1) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))) - (WrapperStruct00.var_1_12 - 3.4f)))))) && ((WrapperStruct00.var_1_6 <= WrapperStruct00.var_1_5) ? ((((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_12 / WrapperStruct00.var_1_15))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_12 / WrapperStruct00.var_1_15)))) > ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_7)))) && ((WrapperStruct00.var_1_6 > (WrapperStruct00.var_1_13 * ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7))))) ? ((WrapperStruct00.var_1_17 || WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_16 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_16 == ((unsigned short int) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_16 == ((unsigned short int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return ((((WrapperStruct00.var_1_8 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))) ? (WrapperStruct00.var_1_5) : ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7))))))) : 1) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))) - (WrapperStruct00.var_1_12 - 3.4f)))))) && ((WrapperStruct00.var_1_6 <= WrapperStruct00.var_1_5) ? ((((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_12 / WrapperStruct00.var_1_15))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_12 / WrapperStruct00.var_1_15)))) > ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_7)))) && ((WrapperStruct00.var_1_6 > (WrapperStruct00.var_1_13 * ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7))))) ? ((WrapperStruct00.var_1_17 || WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_16 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_16 == ((unsigned short int) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_16 == ((unsigned short int) WrapperStruct00.var_1_6))) ; [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, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 786 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 572 IncrementalHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 499 mSDtfsCounter, 572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1046 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2981/3060 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-02-06 03:56:17,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2b5980e1479d314973e22beecd1bd5f4f4b295fb19f9db6b2f7cc86f57a089b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:56:19,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:56:19,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:56:19,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:56:19,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:56:19,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:56:19,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:56:19,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:56:19,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:56:19,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:56:19,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:56:19,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:56:19,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:56:19,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:56:19,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:56:19,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:19,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:56:19,240 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2b5980e1479d314973e22beecd1bd5f4f4b295fb19f9db6b2f7cc86f57a089b [2025-02-06 03:56:19,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:56:19,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:56:19,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:56:19,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:56:19,503 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:56:19,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i [2025-02-06 03:56:20,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3a2717e2/d2cf59470c7b437ca4e79d9a8d71704e/FLAG2594cdc2a [2025-02-06 03:56:20,917 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:56:20,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i [2025-02-06 03:56:20,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3a2717e2/d2cf59470c7b437ca4e79d9a8d71704e/FLAG2594cdc2a [2025-02-06 03:56:20,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3a2717e2/d2cf59470c7b437ca4e79d9a8d71704e [2025-02-06 03:56:20,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:56:20,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:56:20,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:20,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:56:20,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:56:20,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:20" (1/1) ... [2025-02-06 03:56:20,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae96158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:20, skipping insertion in model container [2025-02-06 03:56:20,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:20" (1/1) ... [2025-02-06 03:56:20,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:56:21,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i[916,929] [2025-02-06 03:56:21,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:21,144 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:56:21,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-77.i[916,929] [2025-02-06 03:56:21,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:21,225 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:56:21,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21 WrapperNode [2025-02-06 03:56:21,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:21,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:21,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:56:21,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:56:21,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,284 INFO L138 Inliner]: procedures = 37, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 620 [2025-02-06 03:56:21,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:21,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:56:21,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:56:21,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:56:21,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,321 INFO L175 MemorySlicer]: Split 166 memory accesses to 2 slices as follows [2, 164]. 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-02-06 03:56:21,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:56:21,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:56:21,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:56:21,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:56:21,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (1/1) ... [2025-02-06 03:56:21,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:21,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:21,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:56:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:56:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:56:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:56:21,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:56:21,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:56:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:56:21,509 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:56:21,510 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:56:44,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem138#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite161#1;havoc property_#t~mem146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~ite150#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~ite158#1;havoc property_#t~mem157#1;havoc property_#t~mem156#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~short162#1;havoc property_#t~mem169#1;havoc property_#t~mem168#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite180#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~short172#1;havoc property_#t~ite177#1;havoc property_#t~mem174#1;havoc property_#t~mem173#1;havoc property_#t~mem176#1;havoc property_#t~mem175#1;havoc property_#t~mem179#1;havoc property_#t~mem178#1;havoc property_#t~short181#1; [2025-02-06 03:56:44,578 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-02-06 03:56:44,579 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:56:44,586 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:56:44,587 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:56:44,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:44 BoogieIcfgContainer [2025-02-06 03:56:44,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:56:44,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:56:44,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:56:44,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:56:44,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:56:20" (1/3) ... [2025-02-06 03:56:44,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6b80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:44, skipping insertion in model container [2025-02-06 03:56:44,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:21" (2/3) ... [2025-02-06 03:56:44,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6b80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:44, skipping insertion in model container [2025-02-06 03:56:44,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:44" (3/3) ... [2025-02-06 03:56:44,613 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-77.i [2025-02-06 03:56:44,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:56:44,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-77.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:56:44,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:56:44,684 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;@7387171e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:56:44,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:56:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:56:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:44,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:44,701 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:44,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1477745845, now seen corresponding path program 1 times [2025-02-06 03:56:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699996209] [2025-02-06 03:56:44,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:44,716 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-02-06 03:56:44,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:44,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:56:44,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:56:44,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:44,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:44,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:56:44,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-06 03:56:45,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:45,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:56:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699996209] [2025-02-06 03:56:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699996209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:45,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:56:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362620764] [2025-02-06 03:56:45,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:45,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:56:45,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:56:45,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:56:45,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:56:45,026 INFO L87 Difference]: Start difference. First operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:56:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:45,043 INFO L93 Difference]: Finished difference Result 252 states and 397 transitions. [2025-02-06 03:56:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:56:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-02-06 03:56:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:45,049 INFO L225 Difference]: With dead ends: 252 [2025-02-06 03:56:45,049 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 03:56:45,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-02-06 03:56:45,052 INFO L435 NwaCegarLoop]: 187 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, 187 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-02-06 03:56:45,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 03:56:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-06 03:56:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:56:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2025-02-06 03:56:45,076 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 187 transitions. Word has length 151 [2025-02-06 03:56:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:45,076 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 187 transitions. [2025-02-06 03:56:45,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:56:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 187 transitions. [2025-02-06 03:56:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 03:56:45,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:45,079 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:45,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:56:45,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:56:45,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:45,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash -431912887, now seen corresponding path program 1 times [2025-02-06 03:56:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:45,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215914963] [2025-02-06 03:56:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:45,281 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-02-06 03:56:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:45,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:56:45,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:56:45,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 03:56:45,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 03:56:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:45,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:56:45,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:56:46,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:46,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:56:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215914963] [2025-02-06 03:56:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215914963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:46,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799328891] [2025-02-06 03:56:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:46,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:56:46,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:46,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:46,031 INFO L87 Difference]: Start difference. First operand 126 states and 187 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:56:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:46,486 INFO L93 Difference]: Finished difference Result 251 states and 374 transitions. [2025-02-06 03:56:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:46,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-02-06 03:56:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:46,490 INFO L225 Difference]: With dead ends: 251 [2025-02-06 03:56:46,491 INFO L226 Difference]: Without dead ends: 128 [2025-02-06 03:56:46,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:46,492 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:46,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-06 03:56:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-06 03:56:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:56:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2025-02-06 03:56:46,500 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 151 [2025-02-06 03:56:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:46,501 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2025-02-06 03:56:46,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:56:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2025-02-06 03:56:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:56:46,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:46,503 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:46,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:56:46,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1220728281, now seen corresponding path program 1 times [2025-02-06 03:56:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:56:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465995211] [2025-02-06 03:56:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:46,705 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-02-06 03:56:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:56:46,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:56:46,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:56:46,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:56:47,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:56:47,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:47,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:56:47,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:51,533 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-02-06 03:56:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 03:56:52,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:52,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:56:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465995211] [2025-02-06 03:56:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465995211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185566644] [2025-02-06 03:56:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:56:52,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:52,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:52,178 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:57:02,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:06,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:10,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:14,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:19,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:23,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:27,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:31,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:38,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:42,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:46,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:57:50,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []