./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.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 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:05:47,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:05:47,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:05:47,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:05:47,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:05:47,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:05:47,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:05:47,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:05:47,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:05:47,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:05:47,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:05:47,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:05:47,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:05:47,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:05:47,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:05:47,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:05:47,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:05:47,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:05:47,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:05:47,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:05:47,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:05:47,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:05:47,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:05:47,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:05:47,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:05:47,248 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 -> 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 [2025-03-04 01:05:47,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:05:47,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:05:47,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:05:47,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:05:47,468 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:05:47,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2025-03-04 01:05:48,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499262efc/436cce2edefa4fb2bb4f99bc655d6fb7/FLAGe5295574c [2025-03-04 01:05:48,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:05:48,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2025-03-04 01:05:48,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499262efc/436cce2edefa4fb2bb4f99bc655d6fb7/FLAGe5295574c [2025-03-04 01:05:49,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499262efc/436cce2edefa4fb2bb4f99bc655d6fb7 [2025-03-04 01:05:49,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:05:49,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:05:49,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:05:49,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:05:49,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:05:49,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1428c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49, skipping insertion in model container [2025-03-04 01:05:49,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:05:49,237 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-a_file-41.i[916,929] [2025-03-04 01:05:49,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:05:49,303 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:05:49,312 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-a_file-41.i[916,929] [2025-03-04 01:05:49,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:05:49,373 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:05:49,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49 WrapperNode [2025-03-04 01:05:49,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:05:49,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:05:49,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:05:49,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:05:49,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,429 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2025-03-04 01:05:49,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:05:49,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:05:49,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:05:49,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:05:49,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,471 INFO L175 MemorySlicer]: Split 111 memory accesses to 7 slices as follows [2, 18, 15, 35, 7, 23, 11]. 32 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 2, 4, 1, 2, 1]. The 17 writes are split as follows [0, 2, 2, 6, 2, 2, 3]. [2025-03-04 01:05:49,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:05:49,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:05:49,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:05:49,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:05:49,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (1/1) ... [2025-03-04 01:05:49,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:05:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:49,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:05:49,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:05:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:05:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:05:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:05:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:05:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:05:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:05:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:05:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:05:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:05:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:05:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:05:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:05:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:05:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:05:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:05:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:05:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:05:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:05:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:05:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:05:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:05:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:05:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:05:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:05:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:05:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:05:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:05:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:05:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:05:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:05:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:05:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:05:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:05:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:05:49,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:05:49,663 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:05:49,665 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:05:49,975 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-04 01:05:50,013 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-03-04 01:05:50,013 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:05:50,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:05:50,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:05:50,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:50 BoogieIcfgContainer [2025-03-04 01:05:50,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:05:50,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:05:50,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:05:50,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:05:50,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:05:49" (1/3) ... [2025-03-04 01:05:50,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd8437f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:05:50, skipping insertion in model container [2025-03-04 01:05:50,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:49" (2/3) ... [2025-03-04 01:05:50,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd8437f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:05:50, skipping insertion in model container [2025-03-04 01:05:50,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:50" (3/3) ... [2025-03-04 01:05:50,035 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-41.i [2025-03-04 01:05:50,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:05:50,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:05:50,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:05:50,108 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;@4217a276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:05:50,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:05:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:05:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:05:50,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:50,120 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:50,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:50,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash 134934688, now seen corresponding path program 1 times [2025-03-04 01:05:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311146952] [2025-03-04 01:05:50,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:50,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:05:50,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:05:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:05:50,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:50,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311146952] [2025-03-04 01:05:50,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311146952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445793550] [2025-03-04 01:05:50,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:50,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:05:50,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:50,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:05:50,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:05:50,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:05:50,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:05:50,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:50,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:50,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:05:50,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:05:50,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445793550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:05:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:05:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181706914] [2025-03-04 01:05:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:05:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:05:50,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:05:50,639 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:05:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:50,665 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-03-04 01:05:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:05:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-04 01:05:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:50,672 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:05:50,672 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 01:05:50,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:05:50,679 INFO L435 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:50,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 01:05:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 01:05:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:05:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-04 01:05:50,718 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-03-04 01:05:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:50,719 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-04 01:05:50,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:05:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-04 01:05:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:05:50,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:50,723 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:50,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:05:50,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:05:50,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2093516058, now seen corresponding path program 1 times [2025-03-04 01:05:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418546459] [2025-03-04 01:05:50,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:50,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:05:51,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:05:51,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:51,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:05:51,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418546459] [2025-03-04 01:05:51,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418546459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:51,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:51,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:05:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247402770] [2025-03-04 01:05:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:51,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:51,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:51,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:05:51,570 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:05:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:51,696 INFO L93 Difference]: Finished difference Result 216 states and 306 transitions. [2025-03-04 01:05:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:05:51,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-04 01:05:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:51,700 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:05:51,701 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:05:51,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:51,702 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 74 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:51,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 593 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:05:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:05:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-04 01:05:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 109 states have internal predecessors, (143), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:05:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 191 transitions. [2025-03-04 01:05:51,714 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 191 transitions. Word has length 114 [2025-03-04 01:05:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:51,715 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 191 transitions. [2025-03-04 01:05:51,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:05:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 191 transitions. [2025-03-04 01:05:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:05:51,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:51,719 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:51,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:05:51,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:51,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1138485557, now seen corresponding path program 1 times [2025-03-04 01:05:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:51,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685886801] [2025-03-04 01:05:51,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:51,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:05:51,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:05:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:05:51,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:51,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685886801] [2025-03-04 01:05:51,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685886801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:05:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106982586] [2025-03-04 01:05:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:51,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:05:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:51,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:05:51,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:05:51,899 INFO L87 Difference]: Start difference. First operand 135 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:05:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:51,919 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2025-03-04 01:05:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:05:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:05:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:51,925 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:05:51,925 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:05:51,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:05:51,928 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:51,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:05:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 01:05:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 82 states have internal predecessors, (102), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:05:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2025-03-04 01:05:51,941 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 115 [2025-03-04 01:05:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:51,942 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2025-03-04 01:05:51,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:05:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2025-03-04 01:05:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:05:51,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:51,945 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:05:51,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1106924536, now seen corresponding path program 1 times [2025-03-04 01:05:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687281190] [2025-03-04 01:05:51,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:51,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:05:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:05:52,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:52,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:05:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687281190] [2025-03-04 01:05:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687281190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:52,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:05:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836457123] [2025-03-04 01:05:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:52,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:52,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:52,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:52,848 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:05:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:53,110 INFO L93 Difference]: Finished difference Result 269 states and 370 transitions. [2025-03-04 01:05:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:05:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-03-04 01:05:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:53,114 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:05:53,114 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 01:05:53,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:05:53,116 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 96 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:53,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 818 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:05:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 01:05:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-03-04 01:05:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.25) internal successors, (170), 138 states have internal predecessors, (170), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:05:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 246 transitions. [2025-03-04 01:05:53,134 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 246 transitions. Word has length 116 [2025-03-04 01:05:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:53,135 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 246 transitions. [2025-03-04 01:05:53,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:05:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 246 transitions. [2025-03-04 01:05:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:05:53,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:53,136 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:05:53,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1380588297, now seen corresponding path program 1 times [2025-03-04 01:05:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866141942] [2025-03-04 01:05:53,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:53,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:05:53,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:05:53,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:53,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:05:53,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:05:53,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:05:53,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:05:53,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:05:53,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:05:53,299 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:05:53,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:05:53,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:05:53,304 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 01:05:53,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:05:53,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:05:53 BoogieIcfgContainer [2025-03-04 01:05:53,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:05:53,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:05:53,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:05:53,391 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:05:53,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:50" (3/4) ... [2025-03-04 01:05:53,394 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:05:53,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:05:53,396 INFO L158 Benchmark]: Toolchain (without parser) took 4273.20ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 121.5MB in the beginning and 58.2MB in the end (delta: 63.3MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2025-03-04 01:05:53,396 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:05:53,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.95ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 106.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:05:53,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.03ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:05:53,397 INFO L158 Benchmark]: Boogie Preprocessor took 64.51ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 99.7MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:05:53,397 INFO L158 Benchmark]: IcfgBuilder took 531.90ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 70.7MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:05:53,397 INFO L158 Benchmark]: TraceAbstraction took 3360.96ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 69.9MB in the beginning and 58.3MB in the end (delta: 11.6MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2025-03-04 01:05:53,397 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 209.7MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:05:53,399 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.78ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.95ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 106.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.03ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.51ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 99.7MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 531.90ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 70.7MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3360.96ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 69.9MB in the beginning and 58.3MB in the end (delta: 11.6MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 209.7MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 2 }; [L40] signed char last_1_signed_char_Array_0_1__1_ = -16; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR signed_char_Array_0[1][1] [L98] last_1_signed_char_Array_0_1__1_ = signed_char_Array_0[1][1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L91] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_) [L45] EXPR unsigned_char_Array_0[1] [L45] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L47] EXPR double_Array_0[1] [L47] double_Array_0[0] = (double_Array_0[1] - 8.3) [L48] EXPR double_Array_0[1] [L48] EXPR double_Array_0[0] [L48] unsigned char stepLocal_1 = double_Array_0[1] >= double_Array_0[0]; [L49] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1] && stepLocal_1 [L50] EXPR unsigned_char_Array_0[0] [L50] signed_long_int_Array_0[0] = unsigned_char_Array_0[0] [L54] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND TRUE BOOL_unsigned_char_Array_0[1] [L55] EXPR unsigned_char_Array_0[0] [L55] EXPR unsigned_char_Array_0[0] [L55] unsigned_short_int_Array_0[0] = (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[0] [L63] EXPR unsigned_char_Array_0[0] [L63] unsigned long int stepLocal_0 = (unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]; [L64] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 > unsigned_short_int_Array_0[0]) [L71] EXPR signed_char_Array_0[0][1] [L71] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L101] EXPR signed_char_Array_0[1][1] [L101] EXPR signed_char_Array_0[0][1] [L101] EXPR (((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) [L101] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))) [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) [L101] EXPR double_Array_0[0] [L101] EXPR double_Array_0[1] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 1737 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1188 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 549 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1794/1820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:05:53,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.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 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:05:55,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:05:55,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:05:55,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:05:55,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:05:55,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:05:55,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:05:55,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:05:55,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:05:55,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:05:55,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:05:55,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:05:55,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:05:55,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:05:55,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:05:55,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:05:55,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:05:55,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:05:55,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:05:55,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:05:55,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:05:55,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:05:55,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:05:55,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:05:55,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:05:55,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:05:55,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:05:55,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:05:55,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:05:55,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:05:55,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:05:55,414 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 -> 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 [2025-03-04 01:05:55,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:05:55,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:05:55,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:05:55,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:05:55,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:05:55,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2025-03-04 01:05:56,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceff9bb5b/d81c7e7bf6e847dd8be934e8807b2937/FLAGf7e960c55 [2025-03-04 01:05:57,036 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:05:57,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2025-03-04 01:05:57,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceff9bb5b/d81c7e7bf6e847dd8be934e8807b2937/FLAGf7e960c55 [2025-03-04 01:05:57,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceff9bb5b/d81c7e7bf6e847dd8be934e8807b2937 [2025-03-04 01:05:57,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:05:57,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:05:57,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:05:57,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:05:57,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:05:57,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c6d113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57, skipping insertion in model container [2025-03-04 01:05:57,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:05:57,191 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-a_file-41.i[916,929] [2025-03-04 01:05:57,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:05:57,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:05:57,251 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-a_file-41.i[916,929] [2025-03-04 01:05:57,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:05:57,304 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:05:57,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57 WrapperNode [2025-03-04 01:05:57,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:05:57,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:05:57,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:05:57,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:05:57,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,358 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 400 [2025-03-04 01:05:57,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:05:57,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:05:57,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:05:57,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:05:57,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,394 INFO L175 MemorySlicer]: Split 111 memory accesses to 7 slices as follows [2, 18, 15, 35, 7, 23, 11]. 32 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 2, 4, 1, 2, 1]. The 17 writes are split as follows [0, 2, 2, 6, 2, 2, 3]. [2025-03-04 01:05:57,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:05:57,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:05:57,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:05:57,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:05:57,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (1/1) ... [2025-03-04 01:05:57,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:05:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:57,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:05:57,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:05:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:05:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:05:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:05:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:05:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:05:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:05:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:05:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:05:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:05:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:05:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:05:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:05:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:05:57,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:05:57,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:05:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:05:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:05:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:05:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:05:57,663 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:05:57,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:05:58,330 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-04 01:05:58,378 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-03-04 01:05:58,378 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:05:58,386 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:05:58,387 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:05:58,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:58 BoogieIcfgContainer [2025-03-04 01:05:58,387 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:05:58,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:05:58,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:05:58,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:05:58,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:05:57" (1/3) ... [2025-03-04 01:05:58,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:05:58, skipping insertion in model container [2025-03-04 01:05:58,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:57" (2/3) ... [2025-03-04 01:05:58,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:05:58, skipping insertion in model container [2025-03-04 01:05:58,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:58" (3/3) ... [2025-03-04 01:05:58,395 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-41.i [2025-03-04 01:05:58,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:05:58,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:05:58,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:05:58,458 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;@120bb75d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:05:58,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:05:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:05:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:05:58,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:58,467 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:58,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:58,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash 134934688, now seen corresponding path program 1 times [2025-03-04 01:05:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:58,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024076703] [2025-03-04 01:05:58,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:58,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:05:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:58,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:05:58,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:05:58,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:05:58,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:05:58,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:58,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:58,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:05:58,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-04 01:05:58,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:58,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024076703] [2025-03-04 01:05:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024076703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:58,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:05:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908301554] [2025-03-04 01:05:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:05:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:58,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:05:58,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:05:58,855 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:05:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:58,873 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-03-04 01:05:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:05:58,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-04 01:05:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:58,879 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:05:58,880 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 01:05:58,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:05:58,884 INFO L435 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:58,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 01:05:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 01:05:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:05:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-04 01:05:58,917 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-03-04 01:05:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:58,917 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-04 01:05:58,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:05:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-04 01:05:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:05:58,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:58,920 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:58,929 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-04 01:05:59,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:05:59,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:59,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2093516058, now seen corresponding path program 1 times [2025-03-04 01:05:59,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:05:59,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120527251] [2025-03-04 01:05:59,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:59,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:05:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:05:59,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:05:59,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:05:59,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:05:59,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:05:59,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:59,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:59,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:05:59,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:59,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:05:59,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:05:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:05:59,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:59,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:05:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120527251] [2025-03-04 01:05:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120527251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:05:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483732640] [2025-03-04 01:05:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:05:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:05:59,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:05:59,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:59,599 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:06:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:00,128 INFO L93 Difference]: Finished difference Result 160 states and 228 transitions. [2025-03-04 01:06:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:06:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-04 01:06:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:00,131 INFO L225 Difference]: With dead ends: 160 [2025-03-04 01:06:00,131 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 01:06:00,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:06:00,132 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:00,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 384 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:06:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 01:06:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-04 01:06:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:06:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2025-03-04 01:06:00,140 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 114 [2025-03-04 01:06:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:00,141 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2025-03-04 01:06:00,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:06:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2025-03-04 01:06:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:06:00,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:00,143 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:00,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:06:00,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:00,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:00,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:00,344 INFO L85 PathProgramCache]: Analyzing trace with hash -900310568, now seen corresponding path program 1 times [2025-03-04 01:06:00,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:00,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751558142] [2025-03-04 01:06:00,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:00,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:00,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:00,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:06:00,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:06:00,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:06:00,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:00,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:00,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:06:00,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:00,677 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-04 01:06:00,940 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 44 treesize of output 31 [2025-03-04 01:06:01,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:06:01,003 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 88 treesize of output 40 [2025-03-04 01:06:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 158 proven. 12 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 01:06:01,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:06:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:06:01,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751558142] [2025-03-04 01:06:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751558142] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:06:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:06:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2025-03-04 01:06:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229714546] [2025-03-04 01:06:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:01,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:06:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:01,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:06:01,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:06:01,193 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:01,369 INFO L93 Difference]: Finished difference Result 216 states and 303 transitions. [2025-03-04 01:06:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:06:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-04 01:06:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:01,372 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:06:01,372 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:06:01,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:06:01,373 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 73 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:01,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 586 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:06:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:06:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-04 01:06:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:06:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 189 transitions. [2025-03-04 01:06:01,394 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 189 transitions. Word has length 116 [2025-03-04 01:06:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:01,396 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 189 transitions. [2025-03-04 01:06:01,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 189 transitions. [2025-03-04 01:06:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:06:01,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:01,398 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:01,411 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 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:06:01,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:01,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:01,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash 542169549, now seen corresponding path program 1 times [2025-03-04 01:06:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624677449] [2025-03-04 01:06:01,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:01,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:01,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:06:01,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:06:01,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:06:01,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:01,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:01,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:06:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:06:01,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:06:01,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624677449] [2025-03-04 01:06:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624677449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:01,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:06:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274713259] [2025-03-04 01:06:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:01,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:06:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:01,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:06:01,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:06:01,843 INFO L87 Difference]: Start difference. First operand 135 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:01,855 INFO L93 Difference]: Finished difference Result 240 states and 335 transitions. [2025-03-04 01:06:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:06:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-04 01:06:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:01,857 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:06:01,857 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:06:01,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:06:01,858 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:01,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:06:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:06:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 01:06:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:06:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2025-03-04 01:06:01,869 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 117 [2025-03-04 01:06:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:01,870 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2025-03-04 01:06:01,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2025-03-04 01:06:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:06:01,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:01,871 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:01,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:06:02,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:02,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:02,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1667625270, now seen corresponding path program 1 times [2025-03-04 01:06:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:02,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114036754] [2025-03-04 01:06:02,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:02,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:02,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:02,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:02,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:06:02,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:06:02,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:06:02,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:02,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:06:02,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:02,329 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 21 treesize of output 17 [2025-03-04 01:06:02,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2025-03-04 01:06:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:06:02,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:06:02,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114036754] [2025-03-04 01:06:02,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114036754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:02,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:02,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:06:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092313004] [2025-03-04 01:06:02,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:06:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:02,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:06:02,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:06:02,405 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:02,732 INFO L93 Difference]: Finished difference Result 269 states and 366 transitions. [2025-03-04 01:06:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:06:02,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-04 01:06:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:02,734 INFO L225 Difference]: With dead ends: 269 [2025-03-04 01:06:02,735 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 01:06:02,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:06:02,735 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 96 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:02,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 702 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:06:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 01:06:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-03-04 01:06:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.2279411764705883) internal successors, (167), 138 states have internal predecessors, (167), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:06:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2025-03-04 01:06:02,762 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 118 [2025-03-04 01:06:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2025-03-04 01:06:02,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2025-03-04 01:06:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:06:02,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:02,764 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:02,773 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 (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:06:02,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:02,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:02,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -819887563, now seen corresponding path program 1 times [2025-03-04 01:06:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:02,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270301765] [2025-03-04 01:06:02,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:02,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:02,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:02,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:02,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:06:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:06:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:06:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:18,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:06:18,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:19,008 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-04 01:06:20,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 101 [2025-03-04 01:06:32,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:06:32,385 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 394 treesize of output 144 [2025-03-04 01:06:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 01:06:33,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:06:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:06:43,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270301765] [2025-03-04 01:06:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270301765] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:06:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:06:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-03-04 01:06:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568791846] [2025-03-04 01:06:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:06:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:43,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:06:43,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:06:43,161 INFO L87 Difference]: Start difference. First operand 179 states and 243 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:48,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:53,324 INFO L93 Difference]: Finished difference Result 422 states and 568 transitions. [2025-03-04 01:06:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:06:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-04 01:06:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:53,333 INFO L225 Difference]: With dead ends: 422 [2025-03-04 01:06:53,333 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 01:06:53,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:06:53,334 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 51 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:53,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 565 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2025-03-04 01:06:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 01:06:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2025-03-04 01:06:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 219 states have internal predecessors, (269), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:06:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 361 transitions. [2025-03-04 01:06:53,354 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 361 transitions. Word has length 118 [2025-03-04 01:06:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:53,354 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 361 transitions. [2025-03-04 01:06:53,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:06:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 361 transitions. [2025-03-04 01:06:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:06:53,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:53,355 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:53,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:06:53,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:53,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -608536650, now seen corresponding path program 1 times [2025-03-04 01:06:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547479194] [2025-03-04 01:06:53,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:53,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:53,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:53,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:06:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:06:54,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:06:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:54,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:06:54,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:54,346 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-04 01:06:56,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 01:06:56,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:06:56,809 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 321 treesize of output 141 [2025-03-04 01:06:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 151 proven. 54 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-04 01:06:59,421 INFO L312 TraceCheckSpWp]: Computing backward predicates...