./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:53:38,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:53:38,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:53:38,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:53:38,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:53:38,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:53:38,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:53:38,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:53:38,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:53:38,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:53:38,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:53:38,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:53:38,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:53:38,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:53:38,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:53:38,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:53:38,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:53:38,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:53:38,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:53:38,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:53:38,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:53:38,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:53:38,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:53:38,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:53:38,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:53:38,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:53:38,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:53:38,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a [2025-03-08 16:53:38,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:53:38,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:53:38,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:53:38,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:53:38,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:53:38,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-08 16:53:39,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf11691f5/3cd0ee4eef84468c8d353b10843b5f01/FLAG5e4ec3e03 [2025-03-08 16:53:39,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:53:39,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-08 16:53:39,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf11691f5/3cd0ee4eef84468c8d353b10843b5f01/FLAG5e4ec3e03 [2025-03-08 16:53:39,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf11691f5/3cd0ee4eef84468c8d353b10843b5f01 [2025-03-08 16:53:39,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:53:39,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:53:39,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:53:39,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:53:39,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:53:39,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:53:39" (1/1) ... [2025-03-08 16:53:39,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b79a7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:39, skipping insertion in model container [2025-03-08 16:53:39,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:53:39" (1/1) ... [2025-03-08 16:53:39,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:53:39,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2025-03-08 16:53:39,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:53:39,997 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:53:40,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2025-03-08 16:53:40,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:53:40,061 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:53:40,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40 WrapperNode [2025-03-08 16:53:40,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:53:40,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:53:40,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:53:40,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:53:40,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,119 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2025-03-08 16:53:40,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:53:40,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:53:40,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:53:40,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:53:40,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,135 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:53:40,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:53:40,164 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:53:40,164 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:53:40,164 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:53:40,165 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (1/1) ... [2025-03-08 16:53:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:53:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:40,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:53:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:53:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:53:40,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:53:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:53:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:53:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:53:40,297 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:53:40,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:53:40,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~mem92#1;havoc property_#t~ite106#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~ite105#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~bitwise130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short141#1; [2025-03-08 16:53:40,701 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-08 16:53:40,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:53:40,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:53:40,717 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:53:40,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:53:40 BoogieIcfgContainer [2025-03-08 16:53:40,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:53:40,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:53:40,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:53:40,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:53:40,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:53:39" (1/3) ... [2025-03-08 16:53:40,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fca05cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:53:40, skipping insertion in model container [2025-03-08 16:53:40,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:53:40" (2/3) ... [2025-03-08 16:53:40,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fca05cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:53:40, skipping insertion in model container [2025-03-08 16:53:40,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:53:40" (3/3) ... [2025-03-08 16:53:40,726 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-64.i [2025-03-08 16:53:40,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:53:40,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-64.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:53:40,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:53:40,786 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;@4640da43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:53:40,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:53:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:53:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 16:53:40,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:40,800 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:40,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1380903475, now seen corresponding path program 1 times [2025-03-08 16:53:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849887086] [2025-03-08 16:53:40,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 16:53:40,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 16:53:40,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:40,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 16:53:41,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849887086] [2025-03-08 16:53:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849887086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557132335] [2025-03-08 16:53:41,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:41,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:41,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:41,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:41,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:53:41,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 16:53:41,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 16:53:41,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:41,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:53:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 16:53:41,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:53:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557132335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:53:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:53:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189268866] [2025-03-08 16:53:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:41,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:53:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:41,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:53:41,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:53:41,388 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:53:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:41,416 INFO L93 Difference]: Finished difference Result 250 states and 395 transitions. [2025-03-08 16:53:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:53:41,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2025-03-08 16:53:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:41,425 INFO L225 Difference]: With dead ends: 250 [2025-03-08 16:53:41,426 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 16:53:41,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:53:41,430 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:41,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 16:53:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-08 16:53:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:53:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2025-03-08 16:53:41,468 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 159 [2025-03-08 16:53:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:41,468 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2025-03-08 16:53:41,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:53:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2025-03-08 16:53:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 16:53:41,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:41,472 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:41,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:53:41,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:53:41,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:41,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash -51910915, now seen corresponding path program 1 times [2025-03-08 16:53:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:41,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515875019] [2025-03-08 16:53:41,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:41,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 16:53:41,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 16:53:41,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:53:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:42,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515875019] [2025-03-08 16:53:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515875019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:42,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711286004] [2025-03-08 16:53:42,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:42,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:42,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:53:42,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 16:53:42,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 16:53:42,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:42,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:42,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:53:42,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:53:42,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:53:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711286004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:53:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 16:53:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738215012] [2025-03-08 16:53:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:53:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:42,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:53:42,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:42,329 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:53:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:42,365 INFO L93 Difference]: Finished difference Result 249 states and 370 transitions. [2025-03-08 16:53:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:53:42,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-03-08 16:53:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:42,369 INFO L225 Difference]: With dead ends: 249 [2025-03-08 16:53:42,369 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 16:53:42,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 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-03-08 16:53:42,372 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:42,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 16:53:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 16:53:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:53:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2025-03-08 16:53:42,388 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 159 [2025-03-08 16:53:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:42,389 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2025-03-08 16:53:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:53:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2025-03-08 16:53:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 16:53:42,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:42,391 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:42,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:53:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 16:53:42,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2000295401, now seen corresponding path program 1 times [2025-03-08 16:53:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209511661] [2025-03-08 16:53:42,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 16:53:42,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 16:53:42,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:42,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:53:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209511661] [2025-03-08 16:53:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209511661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450185463] [2025-03-08 16:53:42,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:42,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:42,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:53:43,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 16:53:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 16:53:43,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:43,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:53:43,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:53:43,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:53:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450185463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:43,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:53:43,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:53:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200499374] [2025-03-08 16:53:43,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:43,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:53:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:43,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:53:43,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:43,144 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:53:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:43,193 INFO L93 Difference]: Finished difference Result 254 states and 375 transitions. [2025-03-08 16:53:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:53:43,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2025-03-08 16:53:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:43,196 INFO L225 Difference]: With dead ends: 254 [2025-03-08 16:53:43,197 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 16:53:43,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:43,199 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:43,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 703 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:53:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 16:53:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-08 16:53:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:53:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-03-08 16:53:43,211 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 161 [2025-03-08 16:53:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-03-08 16:53:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:53:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-03-08 16:53:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 16:53:43,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:43,217 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:43,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:53:43,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:43,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:43,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2069442808, now seen corresponding path program 1 times [2025-03-08 16:53:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968527755] [2025-03-08 16:53:43,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 16:53:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 16:53:43,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:43,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:53:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968527755] [2025-03-08 16:53:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968527755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:53:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047808940] [2025-03-08 16:53:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:53:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:45,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:53:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:45,182 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:53:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:46,004 INFO L93 Difference]: Finished difference Result 435 states and 636 transitions. [2025-03-08 16:53:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:53:46,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-03-08 16:53:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:46,006 INFO L225 Difference]: With dead ends: 435 [2025-03-08 16:53:46,006 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 16:53:46,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:53:46,007 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 298 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:46,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 650 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:53:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 16:53:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 215. [2025-03-08 16:53:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 172 states have (on average 1.372093023255814) internal successors, (236), 172 states have internal predecessors, (236), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:53:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 316 transitions. [2025-03-08 16:53:46,038 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 316 transitions. Word has length 162 [2025-03-08 16:53:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:46,039 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 316 transitions. [2025-03-08 16:53:46,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:53:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 316 transitions. [2025-03-08 16:53:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 16:53:46,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:46,041 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:46,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:53:46,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:46,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2064006425, now seen corresponding path program 1 times [2025-03-08 16:53:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720279318] [2025-03-08 16:53:46,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:46,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 16:53:46,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 16:53:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:53:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720279318] [2025-03-08 16:53:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720279318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:53:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678236582] [2025-03-08 16:53:47,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:47,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:47,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:47,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:53:47,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 16:53:47,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 16:53:47,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:47,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:47,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 16:53:47,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:47,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:53:47,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:53:47,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:53:47,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2025-03-08 16:53:47,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:53:47,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 17 [2025-03-08 16:53:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 357 proven. 18 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-08 16:53:47,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:53:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:53:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678236582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:53:48,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:53:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 15] total 33 [2025-03-08 16:53:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483820854] [2025-03-08 16:53:48,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:53:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 16:53:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 16:53:48,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:53:48,691 INFO L87 Difference]: Start difference. First operand 215 states and 316 transitions. Second operand has 33 states, 30 states have (on average 5.266666666666667) internal successors, (158), 33 states have internal predecessors, (158), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2025-03-08 16:53:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:52,259 INFO L93 Difference]: Finished difference Result 571 states and 814 transitions. [2025-03-08 16:53:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-08 16:53:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.266666666666667) internal successors, (158), 33 states have internal predecessors, (158), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) Word has length 163 [2025-03-08 16:53:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:52,262 INFO L225 Difference]: With dead ends: 571 [2025-03-08 16:53:52,262 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 16:53:52,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=807, Invalid=5355, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 16:53:52,266 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1389 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 3235 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 3235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:52,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1781 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 3235 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 16:53:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 16:53:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 250. [2025-03-08 16:53:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 203 states have (on average 1.3596059113300492) internal successors, (276), 203 states have internal predecessors, (276), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:53:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 356 transitions. [2025-03-08 16:53:52,285 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 356 transitions. Word has length 163 [2025-03-08 16:53:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:52,285 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 356 transitions. [2025-03-08 16:53:52,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.266666666666667) internal successors, (158), 33 states have internal predecessors, (158), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2025-03-08 16:53:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 356 transitions. [2025-03-08 16:53:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 16:53:52,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:52,287 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:52,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:53:52,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:52,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:52,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash -537671318, now seen corresponding path program 1 times [2025-03-08 16:53:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644334002] [2025-03-08 16:53:52,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 16:53:52,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 16:53:52,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:52,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:53:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750759568] [2025-03-08 16:53:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:52,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:52,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:52,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:53:52,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 16:53:53,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 16:53:53,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:53,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:53,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 16:53:53,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:53:53,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2025-03-08 16:53:53,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:53:53,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 18 [2025-03-08 16:53:53,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:53:53,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 16:53:53,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:53:53,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 16:53:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 343 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:53:53,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:53:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:53:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644334002] [2025-03-08 16:53:54,494 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:53:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750759568] [2025-03-08 16:53:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750759568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:53:54,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:53:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2025-03-08 16:53:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045903031] [2025-03-08 16:53:54,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:53:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:53:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:54,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:53:54,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:53:54,496 INFO L87 Difference]: Start difference. First operand 250 states and 356 transitions. Second operand has 15 states, 13 states have (on average 10.076923076923077) internal successors, (131), 15 states have internal predecessors, (131), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) [2025-03-08 16:53:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:55,694 INFO L93 Difference]: Finished difference Result 476 states and 669 transitions. [2025-03-08 16:53:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:53:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 10.076923076923077) internal successors, (131), 15 states have internal predecessors, (131), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) Word has length 164 [2025-03-08 16:53:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:55,697 INFO L225 Difference]: With dead ends: 476 [2025-03-08 16:53:55,697 INFO L226 Difference]: Without dead ends: 327 [2025-03-08 16:53:55,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:53:55,698 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 714 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:55,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 505 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 16:53:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-08 16:53:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2025-03-08 16:53:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 263 states have internal predecessors, (353), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:53:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 441 transitions. [2025-03-08 16:53:55,717 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 441 transitions. Word has length 164 [2025-03-08 16:53:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:55,717 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 441 transitions. [2025-03-08 16:53:55,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 10.076923076923077) internal successors, (131), 15 states have internal predecessors, (131), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) [2025-03-08 16:53:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 441 transitions. [2025-03-08 16:53:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 16:53:55,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:55,719 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:55,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:53:55,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:55,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:55,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -831074325, now seen corresponding path program 1 times [2025-03-08 16:53:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876324108] [2025-03-08 16:53:55,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:55,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 16:53:56,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 16:53:56,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:56,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:53:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:53:57,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:53:57,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876324108] [2025-03-08 16:53:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876324108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:53:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:53:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:53:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766727055] [2025-03-08 16:53:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:53:57,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:53:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:53:57,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:53:57,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:53:57,193 INFO L87 Difference]: Start difference. First operand 316 states and 441 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:53:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:53:58,130 INFO L93 Difference]: Finished difference Result 605 states and 853 transitions. [2025-03-08 16:53:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:53:58,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-08 16:53:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:53:58,135 INFO L225 Difference]: With dead ends: 605 [2025-03-08 16:53:58,135 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 16:53:58,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:53:58,136 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 56 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:53:58,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 767 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:53:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 16:53:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 337. [2025-03-08 16:53:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 283 states have (on average 1.3568904593639577) internal successors, (384), 284 states have internal predecessors, (384), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 16:53:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 472 transitions. [2025-03-08 16:53:58,152 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 472 transitions. Word has length 164 [2025-03-08 16:53:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:53:58,152 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 472 transitions. [2025-03-08 16:53:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:53:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 472 transitions. [2025-03-08 16:53:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 16:53:58,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:53:58,154 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:53:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:53:58,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:53:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:53:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1386683628, now seen corresponding path program 1 times [2025-03-08 16:53:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:53:58,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543930426] [2025-03-08 16:53:58,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:53:58,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 16:53:58,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 16:53:58,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:58,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:53:58,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796380047] [2025-03-08 16:53:58,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:53:58,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:53:58,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:53:58,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:53:58,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:53:58,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 16:53:59,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 16:53:59,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:53:59,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:53:59,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:53:59,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 16:54:00,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 16:54:00,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:00,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:54:00,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:54:00,190 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:54:00,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:54:00,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 16:54:00,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:00,395 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:00,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:54:00,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:54:00 BoogieIcfgContainer [2025-03-08 16:54:00,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:54:00,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:54:00,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:54:00,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:54:00,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:53:40" (3/4) ... [2025-03-08 16:54:00,444 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:54:00,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:54:00,445 INFO L158 Benchmark]: Toolchain (without parser) took 20622.00ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.5MB in the beginning and 245.8MB in the end (delta: -133.3MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2025-03-08 16:54:00,445 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:00,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.58ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 95.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:54:00,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.35ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 91.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:00,446 INFO L158 Benchmark]: Boogie Preprocessor took 43.35ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:54:00,446 INFO L158 Benchmark]: IcfgBuilder took 553.66ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 51.0MB in the end (delta: 37.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 16:54:00,446 INFO L158 Benchmark]: TraceAbstraction took 19722.78ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 49.9MB in the beginning and 245.9MB in the end (delta: -196.0MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-03-08 16:54:00,446 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 402.7MB. Free memory was 245.9MB in the beginning and 245.8MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:54:00,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.58ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 95.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.35ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 91.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.35ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 553.66ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 51.0MB in the end (delta: 37.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19722.78ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 49.9MB in the beginning and 245.9MB in the end (delta: -196.0MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 402.7MB. Free memory was 245.9MB in the beginning and 245.8MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 128. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L57] unsigned char last_1_WrapperStruct00_var_1_16 = 10; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_16=10] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_16 [L125] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L135] RET updateLastVariables() [L136] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_6 [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_6 [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_7 [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_7 [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_8 [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_8 [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] 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, last_1_WrapperStruct00_var_1_16=10] [L109] 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, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] 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, last_1_WrapperStruct00_var_1_16=10] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L113] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L120] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L136] RET updateVariables() [L137] CALL step() [L61] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_16; [L62] EXPR WrapperStruct00.var_1_3 [L62] unsigned long int stepLocal_0 = WrapperStruct00.var_1_3; [L63] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2941876005, stepLocal_1=10] [L63] COND TRUE stepLocal_1 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16) [L64] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2941876005] [L64] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2941876005] [L64] COND FALSE !(stepLocal_0 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) [L69] EXPR WrapperStruct00.var_1_9 [L69] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_9 [L72] EXPR WrapperStruct00.var_1_1 [L72] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L72] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR WrapperStruct00.var_1_5 [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L75] EXPR WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L75] unsigned long int stepLocal_2 = WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17); [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_2=0] [L76] COND FALSE !(stepLocal_2 > WrapperStruct00.var_1_3) [L83] EXPR WrapperStruct00.var_1_18 [L83] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_18 [L85] WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L85] COND FALSE !(WrapperStruct00.var_1_10) [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1 [L128] EXPR WrapperStruct00.var_1_3 [L128] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) [L128] EXPR WrapperStruct00.var_1_1 [L128] EXPR WrapperStruct00.var_1_9 [L128] EXPR (WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128-L129] return ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 210 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2485 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2457 mSDsluCounter, 5121 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4078 mSDsCounter, 613 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5243 IncrementalHoareTripleChecker+Invalid, 5856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 613 mSolverCounterUnsat, 1043 mSDtfsCounter, 5243 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1272 GetRequests, 1140 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=7, InterpolantAutomatonStates: 108, 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, 7 MinimizatonAttempts, 317 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2088 ConstructedInterpolants, 0 QuantifiedInterpolants, 9108 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2662 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 9563/9880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:54:00,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:54:02,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:54:02,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:54:02,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:54:02,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:54:02,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:54:02,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:54:02,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:54:02,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:54:02,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:54:02,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:54:02,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:54:02,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:54:02,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:54:02,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:54:02,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:54:02,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:54:02,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:54:02,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:54:02,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:02,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:54:02,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:54:02,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a [2025-03-08 16:54:02,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:54:02,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:54:02,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:54:02,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:54:02,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:54:02,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-08 16:54:03,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19373550c/207cbfd25e06416ca9a5054ce0f75e99/FLAG194be5d0a [2025-03-08 16:54:04,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:54:04,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2025-03-08 16:54:04,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19373550c/207cbfd25e06416ca9a5054ce0f75e99/FLAG194be5d0a [2025-03-08 16:54:04,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19373550c/207cbfd25e06416ca9a5054ce0f75e99 [2025-03-08 16:54:04,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:54:04,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:54:04,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:54:04,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:54:04,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:54:04,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4043e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04, skipping insertion in model container [2025-03-08 16:54:04,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:54:04,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2025-03-08 16:54:04,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:54:04,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:54:04,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2025-03-08 16:54:04,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:54:04,274 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:54:04,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04 WrapperNode [2025-03-08 16:54:04,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:54:04,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:54:04,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:54:04,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:54:04,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,333 INFO L138 Inliner]: procedures = 40, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2025-03-08 16:54:04,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:54:04,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:54:04,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:54:04,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:54:04,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,380 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-03-08 16:54:04,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:54:04,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:54:04,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:54:04,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:54:04,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (1/1) ... [2025-03-08 16:54:04,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:04,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:54:04,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:54:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:54:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 16:54:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:54:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:54:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:54:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:54:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:54:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:54:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:54:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:54:04,569 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:54:04,571 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:54:06,475 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem95#1;havoc property_#t~mem92#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite124#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~ite123#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short125#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem130#1;havoc property_#t~ite135#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short139#1; [2025-03-08 16:54:06,500 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-08 16:54:06,501 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:54:06,507 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:54:06,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:54:06,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:06 BoogieIcfgContainer [2025-03-08 16:54:06,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:54:06,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:54:06,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:54:06,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:54:06,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:54:04" (1/3) ... [2025-03-08 16:54:06,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289cbff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:06, skipping insertion in model container [2025-03-08 16:54:06,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:04" (2/3) ... [2025-03-08 16:54:06,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289cbff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:06, skipping insertion in model container [2025-03-08 16:54:06,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:06" (3/3) ... [2025-03-08 16:54:06,517 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-64.i [2025-03-08 16:54:06,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:54:06,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-64.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:54:06,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:54:06,569 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;@45d3d3c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:54:06,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:54:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:54:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 16:54:06,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:06,583 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:06,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:06,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash 12285033, now seen corresponding path program 1 times [2025-03-08 16:54:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:54:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439805646] [2025-03-08 16:54:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:06,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:06,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:54:06,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:54:06,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:54:06,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 16:54:06,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 16:54:06,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:06,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:06,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:54:06,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-08 16:54:06,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:06,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:54:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439805646] [2025-03-08 16:54:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439805646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:54:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024170458] [2025-03-08 16:54:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:06,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:54:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:54:06,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:54:06,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:54:06,985 INFO L87 Difference]: Start difference. First operand has 120 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:54:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:07,003 INFO L93 Difference]: Finished difference Result 234 states and 371 transitions. [2025-03-08 16:54:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:54:07,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2025-03-08 16:54:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:07,010 INFO L225 Difference]: With dead ends: 234 [2025-03-08 16:54:07,010 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 16:54:07,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:54:07,014 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:07,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:54:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 16:54:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-08 16:54:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:54:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-08 16:54:07,048 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 157 [2025-03-08 16:54:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-08 16:54:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 16:54:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-08 16:54:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 16:54:07,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:07,051 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:07,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:54:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:07,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -254488167, now seen corresponding path program 1 times [2025-03-08 16:54:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:54:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346786758] [2025-03-08 16:54:07,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:07,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:54:07,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:54:07,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:54:07,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 16:54:07,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 16:54:07,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:07,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:54:07,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:54:07,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:07,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:54:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346786758] [2025-03-08 16:54:07,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346786758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:07,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:07,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:54:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402509322] [2025-03-08 16:54:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:07,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:54:07,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:07,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:54:07,679 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:54:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:07,799 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2025-03-08 16:54:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-03-08 16:54:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:07,801 INFO L225 Difference]: With dead ends: 233 [2025-03-08 16:54:07,801 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 16:54:07,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:54:07,803 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:07,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:54:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 16:54:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 16:54:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:54:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2025-03-08 16:54:07,811 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 157 [2025-03-08 16:54:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:07,812 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2025-03-08 16:54:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:54:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2025-03-08 16:54:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 16:54:07,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:07,814 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:07,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:54:08,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:08,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:08,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash 684592467, now seen corresponding path program 1 times [2025-03-08 16:54:08,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:54:08,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340063166] [2025-03-08 16:54:08,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:08,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:08,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:54:08,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:54:08,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:54:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 16:54:08,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 16:54:08,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:08,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:08,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:54:08,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 16:54:08,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:08,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:54:08,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340063166] [2025-03-08 16:54:08,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340063166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:08,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:08,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:54:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152167725] [2025-03-08 16:54:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:08,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:54:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:54:08,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:54:08,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:08,385 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:54:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:08,483 INFO L93 Difference]: Finished difference Result 238 states and 351 transitions. [2025-03-08 16:54:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:54:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2025-03-08 16:54:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:08,485 INFO L225 Difference]: With dead ends: 238 [2025-03-08 16:54:08,485 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 16:54:08,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:08,487 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:08,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 663 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:54:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 16:54:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 16:54:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 16:54:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-03-08 16:54:08,498 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 159 [2025-03-08 16:54:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:08,498 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-03-08 16:54:08,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 16:54:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-03-08 16:54:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:54:08,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:08,503 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:08,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:54:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:08,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:08,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash -448762167, now seen corresponding path program 1 times [2025-03-08 16:54:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:54:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890491231] [2025-03-08 16:54:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:08,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-03-08 16:54:08,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:54:08,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:54:08,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:54:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:54:09,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:54:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:09,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 16:54:09,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:09,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:09,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 71 [2025-03-08 16:54:10,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:10,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 33 [2025-03-08 16:54:10,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:54:10,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 16:54:10,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 16:54:10,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 16:54:10,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 14 [2025-03-08 16:54:10,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-08 16:54:11,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:11,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-08 16:54:11,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:11,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-08 16:54:11,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:11,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-08 16:54:12,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:12,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2025-03-08 16:54:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 487 proven. 39 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 16:54:12,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:54:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:54:26,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:54:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890491231] [2025-03-08 16:54:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890491231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:54:26,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:54:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2025-03-08 16:54:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833813325] [2025-03-08 16:54:26,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:54:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:54:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:54:26,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:54:26,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:54:26,401 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 16 states, 14 states have (on average 9.0) internal successors, (126), 16 states have internal predecessors, (126), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-08 16:54:28,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:54:58,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 16:54:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:59,029 INFO L93 Difference]: Finished difference Result 381 states and 546 transitions. [2025-03-08 16:54:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:54:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 16 states have internal predecessors, (126), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) Word has length 160 [2025-03-08 16:54:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:59,036 INFO L225 Difference]: With dead ends: 381 [2025-03-08 16:54:59,036 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 16:54:59,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:54:59,038 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 456 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:59,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 500 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 28.6s Time] [2025-03-08 16:54:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 16:54:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 199. [2025-03-08 16:54:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 154 states have internal predecessors, (202), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:54:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2025-03-08 16:54:59,070 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 160 [2025-03-08 16:54:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:59,070 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2025-03-08 16:54:59,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 16 states have internal predecessors, (126), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-08 16:54:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2025-03-08 16:54:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 16:54:59,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:59,072 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:59,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:54:59,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:59,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:59,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -742165174, now seen corresponding path program 1 times [2025-03-08 16:54:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:54:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162213744] [2025-03-08 16:54:59,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:59,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:54:59,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:54:59,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:54:59,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:54:59,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 16:54:59,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 16:54:59,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:59,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:59,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 16:54:59,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:59,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:54:59,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 21 [2025-03-08 16:54:59,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:54:59,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2025-03-08 16:54:59,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:55:00,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:55:00,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:55:00,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:55:00,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:55:00,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-08 16:55:04,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:04,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-08 16:55:04,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:04,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-08 16:55:05,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:05,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2025-03-08 16:55:05,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:05,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-03-08 16:55:05,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:05,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 15 [2025-03-08 16:55:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 539 proven. 51 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-08 16:55:06,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:55:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-08 16:55:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 16:55:06,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162213744] [2025-03-08 16:55:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162213744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:55:06,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:55:06,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2025-03-08 16:55:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784954430] [2025-03-08 16:55:06,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:55:06,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:55:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:55:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2025-03-08 16:55:06,869 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 16 states, 14 states have (on average 8.571428571428571) internal successors, (120), 16 states have internal predecessors, (120), 8 states have call successors, (40), 5 states have call predecessors, (40), 7 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40)