./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-60.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 46705387b09ad994e1a51666adbfb1b9ed7a0344d3fcdf3b9d51cd3cb2baf1b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:25:41,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:25:42,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:25:42,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:25:42,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:25:42,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:25:42,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:25:42,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:25:42,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:25:42,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:25:42,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:25:42,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:25:42,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:25:42,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:25:42,058 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:25:42,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:25:42,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:25:42,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:25:42,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:42,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:25:42,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:25:42,061 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 -> 46705387b09ad994e1a51666adbfb1b9ed7a0344d3fcdf3b9d51cd3cb2baf1b7 [2025-03-17 05:25:42,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:25:42,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:25:42,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:25:42,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:25:42,298 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:25:42,300 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-60.i [2025-03-17 05:25:43,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89814abe2/1c65fd52c1074cd5944400c3b091ec33/FLAGa7b94333d [2025-03-17 05:25:43,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:25:43,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-60.i [2025-03-17 05:25:43,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89814abe2/1c65fd52c1074cd5944400c3b091ec33/FLAGa7b94333d [2025-03-17 05:25:43,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89814abe2/1c65fd52c1074cd5944400c3b091ec33 [2025-03-17 05:25:43,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:25:43,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:25:43,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:43,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:25:43,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:25:43,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:43" (1/1) ... [2025-03-17 05:25:43,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d8eee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:43, skipping insertion in model container [2025-03-17 05:25:43,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:43" (1/1) ... [2025-03-17 05:25:43,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:25:44,028 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-60.i[916,929] [2025-03-17 05:25:44,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:44,096 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:25:44,105 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-60.i[916,929] [2025-03-17 05:25:44,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:44,165 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:25:44,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44 WrapperNode [2025-03-17 05:25:44,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:44,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:44,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:25:44,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:25:44,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,235 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2025-03-17 05:25:44,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:44,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:25:44,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:25:44,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:25:44,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,283 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 14, 30, 59, 13, 12]. 45 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 4, 7, 2, 1]. The 18 writes are split as follows [0, 2, 4, 8, 3, 1]. [2025-03-17 05:25:44,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:25:44,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:25:44,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:25:44,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:25:44,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (1/1) ... [2025-03-17 05:25:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:44,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:25:44,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:25:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:25:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:25:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:25:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:25:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:25:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:25:44,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:25:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:25:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:25:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:25:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:25:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:25:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:25:44,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:25:44,507 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:25:44,509 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:25:44,932 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~ite142#1;havoc property_#t~mem130#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem131#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-17 05:25:44,990 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 05:25:44,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:25:45,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:25:45,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:25:45,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:45 BoogieIcfgContainer [2025-03-17 05:25:45,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:25:45,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:25:45,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:25:45,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:25:45,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:25:43" (1/3) ... [2025-03-17 05:25:45,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174258bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:45, skipping insertion in model container [2025-03-17 05:25:45,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:44" (2/3) ... [2025-03-17 05:25:45,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174258bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:45, skipping insertion in model container [2025-03-17 05:25:45,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:45" (3/3) ... [2025-03-17 05:25:45,017 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-60.i [2025-03-17 05:25:45,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:25:45,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-60.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:25:45,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:25:45,099 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;@55495b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:25:45,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:25:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:45,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:45,116 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:45,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:45,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1931950648, now seen corresponding path program 1 times [2025-03-17 05:25:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20540213] [2025-03-17 05:25:45,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:45,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:45,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:45,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:25:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20540213] [2025-03-17 05:25:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20540213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:45,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325034740] [2025-03-17 05:25:45,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:25:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:45,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:25:45,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:25:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:45,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:45,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:25:45,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:25:45,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325034740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:25:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219909379] [2025-03-17 05:25:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:45,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:25:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:25:45,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:45,794 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:45,817 INFO L93 Difference]: Finished difference Result 223 states and 355 transitions. [2025-03-17 05:25:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:25:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:25:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:45,825 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:25:45,825 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:25:45,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:45,834 INFO L435 NwaCegarLoop]: 167 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, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:45,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:25:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 05:25:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2025-03-17 05:25:45,880 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 130 [2025-03-17 05:25:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2025-03-17 05:25:45,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2025-03-17 05:25:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:45,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:45,884 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:45,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:25:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:25:46,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 891406553, now seen corresponding path program 1 times [2025-03-17 05:25:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825095935] [2025-03-17 05:25:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:46,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:46,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:46,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:46,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825095935] [2025-03-17 05:25:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825095935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908192526] [2025-03-17 05:25:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:46,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:46,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:46,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:46,349 INFO L87 Difference]: Start difference. First operand 111 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:46,389 INFO L93 Difference]: Finished difference Result 223 states and 336 transitions. [2025-03-17 05:25:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:46,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:25:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:46,395 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:25:46,395 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 05:25:46,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:46,396 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:46,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 05:25:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 05:25:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 96 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 05:25:46,403 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 130 [2025-03-17 05:25:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:46,404 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 05:25:46,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 05:25:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:46,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:46,405 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:46,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:25:46,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 611056664, now seen corresponding path program 1 times [2025-03-17 05:25:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074045915] [2025-03-17 05:25:46,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:46,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:46,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:25:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074045915] [2025-03-17 05:25:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074045915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:46,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067763888] [2025-03-17 05:25:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:25:46,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:46,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:46,637 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:46,692 INFO L93 Difference]: Finished difference Result 228 states and 341 transitions. [2025-03-17 05:25:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:46,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:25:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:46,700 INFO L225 Difference]: With dead ends: 228 [2025-03-17 05:25:46,700 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:25:46,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:46,701 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:46,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:25:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 05:25:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-03-17 05:25:46,713 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 130 [2025-03-17 05:25:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:46,714 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-03-17 05:25:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-03-17 05:25:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:46,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:46,716 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:46,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:25:46,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:46,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1498560345, now seen corresponding path program 1 times [2025-03-17 05:25:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:25:46,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602469777] [2025-03-17 05:25:46,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:25:46,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:46,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:46,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:25:46,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:25:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:46,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:46,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:46,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:25:46,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:25:46,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:25:46,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:25:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:25:46,980 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 05:25:47,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:25:47,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:25:47 BoogieIcfgContainer [2025-03-17 05:25:47,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:25:47,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:25:47,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:25:47,085 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:25:47,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:45" (3/4) ... [2025-03-17 05:25:47,088 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:25:47,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:25:47,091 INFO L158 Benchmark]: Toolchain (without parser) took 3185.25ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 50.3MB in the end (delta: 71.7MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.75ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.28ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 103.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: Boogie Preprocessor took 86.12ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: IcfgBuilder took 684.73ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 67.5MB in the end (delta: 31.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: TraceAbstraction took 2075.24ms. Allocated memory is still 167.8MB. Free memory was 66.9MB in the beginning and 50.3MB in the end (delta: 16.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-03-17 05:25:47,092 INFO L158 Benchmark]: Witness Printer took 5.58ms. Allocated memory is still 167.8MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:25:47,093 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.26ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.75ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.28ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 103.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.12ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 684.73ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 67.5MB in the end (delta: 31.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2075.24ms. Allocated memory is still 167.8MB. Free memory was 66.9MB in the beginning and 50.3MB in the end (delta: 16.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 5.58ms. Allocated memory is still 167.8MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 27.1kB). 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 41, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { 10, 1 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { 10, 1 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { 10, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 2 }; [L37] float last_1_float_Array_0_5_ = 8.6; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] EXPR float_Array_0[5] [L95] last_1_float_Array_0_5_ = float_Array_0[5] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] double_Array_0[1][0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[1][0] [L74] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L74] EXPR double_Array_0[1][0] [L74] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] double_Array_0[0][1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0][1] [L76] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L76] EXPR double_Array_0[0][1] [L76] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] float_Array_0[0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[2] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] float_Array_0[4] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[4] [L84] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L84] EXPR float_Array_0[4] [L84] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] float_Array_0[6] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[6] [L86] EXPR float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F [L86] EXPR float_Array_0[6] [L86] EXPR float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR (float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR (float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not((float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not((float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L88] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L106] RET updateVariables() [L107] CALL step() [L41] EXPR double_Array_0[0][1] [L41] EXPR double_Array_0[1][0] [L41] double_Array_0[1][1] = (double_Array_0[0][1] - double_Array_0[1][0]) [L42] EXPR unsigned_char_Array_0[0] [L42] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] COND FALSE !((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L52] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L52] COND TRUE BOOL_unsigned_char_Array_0[1] && stepLocal_0 [L53] EXPR float_Array_0[2] [L53] EXPR float_Array_0[4] [L53] EXPR float_Array_0[0] [L53] EXPR float_Array_0[1] [L53] EXPR float_Array_0[6] [L53] float_Array_0[3] = ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))) [L55] double_Array_0[0][0] = 500.25 [L56] EXPR double_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND FALSE !(double_Array_0[0][1] > last_1_float_Array_0_5_) [L63] EXPR float_Array_0[0] [L63] float_Array_0[5] = float_Array_0[0] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR double_Array_0[1][1] [L98] EXPR double_Array_0[0][1] [L98] EXPR double_Array_0[1][0] [L98] EXPR (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR (((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR (((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25))) && ((double_Array_0[0][1] > last_1_float_Array_0_5_) ? (BOOL_unsigned_char_Array_0[0] ? ((double_Array_0[1][0] <= ((((last_1_float_Array_0_5_) < (float_Array_0[4])) ? (last_1_float_Array_0_5_) : (float_Array_0[4])))) ? (float_Array_0[5] == ((float) (float_Array_0[6] + float_Array_0[4]))) : 1) : 1) : (float_Array_0[5] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25))) && ((double_Array_0[0][1] > last_1_float_Array_0_5_) ? (BOOL_unsigned_char_Array_0[0] ? ((double_Array_0[1][0] <= ((((last_1_float_Array_0_5_) < (float_Array_0[4])) ? (last_1_float_Array_0_5_) : (float_Array_0[4])))) ? (float_Array_0[5] == ((float) (float_Array_0[6] + float_Array_0[4]))) : 1) : 1) : (float_Array_0[5] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98-L99] return ((((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25))) && ((double_Array_0[0][1] > last_1_float_Array_0_5_) ? (BOOL_unsigned_char_Array_0[0] ? ((double_Array_0[1][0] <= ((((last_1_float_Array_0_5_) < (float_Array_0[4])) ? (last_1_float_Array_0_5_) : (float_Array_0[4])))) ? (float_Array_0[5] == ((float) (float_Array_0[6] + float_Array_0[4]))) : 1) : 1) : (float_Array_0[5] == ((float) float_Array_0[0]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 186 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1132 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 636 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 496 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1652/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:25:47,109 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-60.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 46705387b09ad994e1a51666adbfb1b9ed7a0344d3fcdf3b9d51cd3cb2baf1b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:25:48,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:25:49,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:25:49,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:25:49,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:25:49,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:25:49,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:25:49,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:25:49,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:25:49,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:25:49,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:25:49,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:25:49,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:25:49,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:25:49,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:25:49,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:25:49,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:25:49,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:25:49,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:25:49,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:25:49,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:25:49,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:25:49,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:25:49,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:49,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:25:49,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:25:49,093 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 -> 46705387b09ad994e1a51666adbfb1b9ed7a0344d3fcdf3b9d51cd3cb2baf1b7 [2025-03-17 05:25:49,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:25:49,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:25:49,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:25:49,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:25:49,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:25:49,344 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-60.i [2025-03-17 05:25:50,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08702bf1d/9cc3a721f3ee46aa9c7db2ead913d3bf/FLAG18475e5d9 [2025-03-17 05:25:50,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:25:50,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-60.i [2025-03-17 05:25:50,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08702bf1d/9cc3a721f3ee46aa9c7db2ead913d3bf/FLAG18475e5d9 [2025-03-17 05:25:50,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08702bf1d/9cc3a721f3ee46aa9c7db2ead913d3bf [2025-03-17 05:25:50,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:25:50,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:25:50,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:50,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:25:50,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:25:50,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:50" (1/1) ... [2025-03-17 05:25:50,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71498af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:50, skipping insertion in model container [2025-03-17 05:25:50,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:25:50" (1/1) ... [2025-03-17 05:25:50,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:25:50,930 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-60.i[916,929] [2025-03-17 05:25:50,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:50,997 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:25:51,009 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-60.i[916,929] [2025-03-17 05:25:51,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:25:51,059 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:25:51,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51 WrapperNode [2025-03-17 05:25:51,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:25:51,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:51,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:25:51,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:25:51,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,136 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2025-03-17 05:25:51,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:25:51,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:25:51,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:25:51,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:25:51,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,177 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 14, 30, 59, 13, 12]. 45 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 4, 7, 2, 1]. The 18 writes are split as follows [0, 2, 4, 8, 3, 1]. [2025-03-17 05:25:51,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:25:51,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:25:51,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:25:51,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:25:51,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (1/1) ... [2025-03-17 05:25:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:25:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:25:51,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:25:51,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:25:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:25:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:25:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:25:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:25:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:25:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:25:51,446 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:25:51,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:25:55,770 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~ite142#1;havoc property_#t~mem130#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem131#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-17 05:25:55,801 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 05:25:55,801 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:25:55,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:25:55,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:25:55,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:55 BoogieIcfgContainer [2025-03-17 05:25:55,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:25:55,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:25:55,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:25:55,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:25:55,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:25:50" (1/3) ... [2025-03-17 05:25:55,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38836b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:55, skipping insertion in model container [2025-03-17 05:25:55,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:25:51" (2/3) ... [2025-03-17 05:25:55,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38836b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:25:55, skipping insertion in model container [2025-03-17 05:25:55,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:25:55" (3/3) ... [2025-03-17 05:25:55,815 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-60.i [2025-03-17 05:25:55,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:25:55,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-60.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:25:55,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:25:55,883 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;@4f3be17e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:25:55,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:25:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:55,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:55,893 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:55,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:55,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:55,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1931950648, now seen corresponding path program 1 times [2025-03-17 05:25:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107786110] [2025-03-17 05:25:55,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:55,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:55,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:55,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:55,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:25:56,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:56,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:56,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:56,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:25:56,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-17 05:25:56,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:56,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:56,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107786110] [2025-03-17 05:25:56,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107786110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:56,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:56,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:25:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950860891] [2025-03-17 05:25:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:56,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:25:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:56,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:25:56,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:56,571 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:56,598 INFO L93 Difference]: Finished difference Result 223 states and 355 transitions. [2025-03-17 05:25:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:25:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:25:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:56,606 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:25:56,607 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:25:56,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:25:56,612 INFO L435 NwaCegarLoop]: 167 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, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:56,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:25:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:25:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 05:25:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2025-03-17 05:25:56,653 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 130 [2025-03-17 05:25:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2025-03-17 05:25:56,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2025-03-17 05:25:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:56,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:56,659 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:56,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:56,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:56,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:56,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash 891406553, now seen corresponding path program 1 times [2025-03-17 05:25:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:56,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705581167] [2025-03-17 05:25:56,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:56,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:56,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:56,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:25:56,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:57,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:57,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:57,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:57,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:25:57,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 05:25:57,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:57,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:57,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705581167] [2025-03-17 05:25:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705581167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:57,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:57,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030839538] [2025-03-17 05:25:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:57,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:57,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:57,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:57,500 INFO L87 Difference]: Start difference. First operand 111 states and 167 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:57,816 INFO L93 Difference]: Finished difference Result 223 states and 336 transitions. [2025-03-17 05:25:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:57,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:25:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:57,824 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:25:57,824 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 05:25:57,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:57,826 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:57,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 05:25:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 05:25:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 96 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 05:25:57,835 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 130 [2025-03-17 05:25:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:57,837 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 05:25:57,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:25:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 05:25:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:57,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:57,839 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:57,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:25:58,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:58,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:58,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 611056664, now seen corresponding path program 1 times [2025-03-17 05:25:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:58,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445286803] [2025-03-17 05:25:58,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:58,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:25:58,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:58,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:58,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:58,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:58,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:25:58,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:25:58,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:58,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:58,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445286803] [2025-03-17 05:25:58,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445286803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:58,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:58,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058667999] [2025-03-17 05:25:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:58,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:58,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:58,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:58,693 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:58,954 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2025-03-17 05:25:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:58,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 05:25:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:58,956 INFO L225 Difference]: With dead ends: 230 [2025-03-17 05:25:58,956 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:25:58,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:58,957 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:58,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 633 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:25:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:25:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 05:25:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:25:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-17 05:25:58,971 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 130 [2025-03-17 05:25:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:58,971 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-17 05:25:58,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:25:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-17 05:25:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:25:58,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:58,973 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:58,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:25:59,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:59,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:59,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1498560345, now seen corresponding path program 1 times [2025-03-17 05:25:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727333646] [2025-03-17 05:25:59,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:59,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:59,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:25:59,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:25:59,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:25:59,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:59,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:25:59,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:59,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:59,963 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-17 05:26:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-17 05:26:00,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:00,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727333646] [2025-03-17 05:26:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727333646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:00,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991921131] [2025-03-17 05:26:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:00,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:00,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:00,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:00,006 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:02,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:04,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:05,115 INFO L93 Difference]: Finished difference Result 234 states and 346 transitions. [2025-03-17 05:26:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 05:26:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:05,121 INFO L225 Difference]: With dead ends: 234 [2025-03-17 05:26:05,121 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:26:05,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:05,122 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 149 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:05,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 456 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 05:26:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:26:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 05:26:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:26:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2025-03-17 05:26:05,134 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 130 [2025-03-17 05:26:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:05,135 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2025-03-17 05:26:05,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2025-03-17 05:26:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:26:05,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:05,137 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:05,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:26:05,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:05,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:05,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1124368731, now seen corresponding path program 1 times [2025-03-17 05:26:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929203151] [2025-03-17 05:26:05,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:05,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:05,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:05,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:26:05,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:26:05,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:26:05,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:26:05,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:05,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:05,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:26:05,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:06,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:06,079 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-17 05:26:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:06,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:06,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929203151] [2025-03-17 05:26:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929203151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102075995] [2025-03-17 05:26:06,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:06,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:06,107 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:09,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:11,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:12,074 INFO L93 Difference]: Finished difference Result 234 states and 344 transitions. [2025-03-17 05:26:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:12,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-17 05:26:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:12,079 INFO L225 Difference]: With dead ends: 234 [2025-03-17 05:26:12,079 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:26:12,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:12,080 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 141 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:12,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 452 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-17 05:26:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:26:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 05:26:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:26:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-03-17 05:26:12,088 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 132 [2025-03-17 05:26:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:12,088 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-03-17 05:26:12,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-03-17 05:26:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:26:12,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:12,090 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:12,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:26:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:12,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 503158233, now seen corresponding path program 1 times [2025-03-17 05:26:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96820806] [2025-03-17 05:26:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:12,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:12,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:26:12,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:26:12,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:26:12,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:26:12,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:12,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:12,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:26:12,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:13,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 05:26:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-17 05:26:13,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:13,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:13,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96820806] [2025-03-17 05:26:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96820806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:13,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056174786] [2025-03-17 05:26:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:13,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:13,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:13,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:13,156 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:15,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:17,206 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2025-03-17 05:26:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:17,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-17 05:26:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:17,212 INFO L225 Difference]: With dead ends: 234 [2025-03-17 05:26:17,212 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:26:17,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:17,214 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 119 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:17,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 444 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-17 05:26:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:26:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 05:26:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:26:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-17 05:26:17,220 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 134 [2025-03-17 05:26:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-17 05:26:17,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-17 05:26:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:26:17,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:17,222 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:17,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:26:17,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:17,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:17,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:17,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2090435621, now seen corresponding path program 1 times [2025-03-17 05:26:17,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370716228] [2025-03-17 05:26:17,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:17,425 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:26:17,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:26:17,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:26:18,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:26:18,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:18,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:18,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:26:18,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:18,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 05:26:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 05:26:18,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:18,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370716228] [2025-03-17 05:26:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370716228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:18,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589732293] [2025-03-17 05:26:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:18,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:18,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:18,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:18,332 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:20,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:22,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:23,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:24,416 INFO L93 Difference]: Finished difference Result 233 states and 339 transitions. [2025-03-17 05:26:24,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:24,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-17 05:26:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:24,422 INFO L225 Difference]: With dead ends: 233 [2025-03-17 05:26:24,422 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 05:26:24,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:24,423 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 111 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:24,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 442 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-17 05:26:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 05:26:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-17 05:26:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:26:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2025-03-17 05:26:24,428 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 136 [2025-03-17 05:26:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2025-03-17 05:26:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:26:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2025-03-17 05:26:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:26:24,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:24,430 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:24,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:26:24,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:24,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:24,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1376744666, now seen corresponding path program 1 times [2025-03-17 05:26:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532082287] [2025-03-17 05:26:24,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:24,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:26:24,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:26:24,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:26:25,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:26:25,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:25,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:25,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:26:25,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:25,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2025-03-17 05:26:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 36 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:26:25,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:26:25,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2025-03-17 05:26:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:26:25,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:25,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532082287] [2025-03-17 05:26:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532082287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:26:25,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:26:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-17 05:26:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560714348] [2025-03-17 05:26:25,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:26:25,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:26:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:25,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:26:25,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:26:25,745 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-17 05:26:27,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:30,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:31,485 INFO L93 Difference]: Finished difference Result 242 states and 348 transitions. [2025-03-17 05:26:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:26:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 138 [2025-03-17 05:26:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:31,490 INFO L225 Difference]: With dead ends: 242 [2025-03-17 05:26:31,490 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 05:26:31,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:26:31,491 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 126 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:31,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 485 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-17 05:26:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 05:26:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-17 05:26:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:26:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2025-03-17 05:26:31,495 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 138 [2025-03-17 05:26:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:31,497 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2025-03-17 05:26:31,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 12 states have internal predecessors, (113), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-17 05:26:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2025-03-17 05:26:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:26:31,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:31,498 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:31,518 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 (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:31,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:31,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1751526311, now seen corresponding path program 1 times [2025-03-17 05:26:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586227574] [2025-03-17 05:26:31,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:31,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:31,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:26:31,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:26:31,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.