./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.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 c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:21:03,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:21:03,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:21:03,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:21:03,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:21:03,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:21:03,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:21:03,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:21:03,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:21:03,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:21:03,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:21:03,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:21:03,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:21:03,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:21:03,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:21:03,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:21:03,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:21:03,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:03,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:21:03,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:21:03,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:21:03,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:21:03,137 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 -> c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 [2025-03-08 16:21:03,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:21:03,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:21:03,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:21:03,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:21:03,382 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:21:03,383 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-75.i [2025-03-08 16:21:04,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf3da6a7/e709dc926d754333ba4da6eac72d2406/FLAG803d43b27 [2025-03-08 16:21:04,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:21:04,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i [2025-03-08 16:21:04,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf3da6a7/e709dc926d754333ba4da6eac72d2406/FLAG803d43b27 [2025-03-08 16:21:05,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf3da6a7/e709dc926d754333ba4da6eac72d2406 [2025-03-08 16:21:05,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:21:05,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:21:05,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:05,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:21:05,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:21:05,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab61f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05, skipping insertion in model container [2025-03-08 16:21:05,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:21:05,233 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-75.i[916,929] [2025-03-08 16:21:05,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:05,283 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:21:05,290 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-75.i[916,929] [2025-03-08 16:21:05,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:05,325 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:21:05,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05 WrapperNode [2025-03-08 16:21:05,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:05,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:05,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:21:05,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:21:05,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,367 INFO L138 Inliner]: procedures = 29, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-03-08 16:21:05,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:05,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:21:05,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:21:05,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:21:05,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,403 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 8, 11, 17, 21, 16, 56]. 43 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 2, 2, 1, 7]. The 18 writes are split as follows [0, 1, 1, 2, 2, 3, 9]. [2025-03-08 16:21:05,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:21:05,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:21:05,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:21:05,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:21:05,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (1/1) ... [2025-03-08 16:21:05,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:05,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:21:05,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:21:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:21:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:21:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:21:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:21:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:21:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:21:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:21:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:21:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:21:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:21:05,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:21:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:21:05,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:21:05,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:21:05,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:21:05,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-03-08 16:21:05,983 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-08 16:21:05,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:21:05,994 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:21:05,995 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:21:05,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:05 BoogieIcfgContainer [2025-03-08 16:21:05,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:21:05,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:21:05,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:21:06,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:21:06,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:21:05" (1/3) ... [2025-03-08 16:21:06,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757847c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:06, skipping insertion in model container [2025-03-08 16:21:06,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:05" (2/3) ... [2025-03-08 16:21:06,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757847c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:06, skipping insertion in model container [2025-03-08 16:21:06,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:05" (3/3) ... [2025-03-08 16:21:06,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-75.i [2025-03-08 16:21:06,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:21:06,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-75.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:21:06,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:21:06,067 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;@68ba8ccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:21:06,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:21:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:06,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:06,081 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:06,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:06,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash -295753078, now seen corresponding path program 1 times [2025-03-08 16:21:06,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:06,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453758197] [2025-03-08 16:21:06,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:06,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:06,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:06,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:06,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:21:06,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:06,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453758197] [2025-03-08 16:21:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453758197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760200173] [2025-03-08 16:21:06,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:06,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:06,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:06,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:06,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:21:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:06,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:06,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:06,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:06,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:21:06,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:21:06,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760200173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:21:06,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:21:06,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345464745] [2025-03-08 16:21:06,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:06,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:21:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:06,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:21:06,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:06,627 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:06,645 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2025-03-08 16:21:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:21:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 16:21:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:06,650 INFO L225 Difference]: With dead ends: 186 [2025-03-08 16:21:06,650 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:21:06,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:06,654 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:06,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:21:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 16:21:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-08 16:21:06,681 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2025-03-08 16:21:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:06,682 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-08 16:21:06,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-08 16:21:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:06,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:06,686 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:06,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:21:06,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:21:06,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1552377367, now seen corresponding path program 1 times [2025-03-08 16:21:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991466097] [2025-03-08 16:21:06,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:06,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:06,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:06,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991466097] [2025-03-08 16:21:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991466097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:07,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:21:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100823332] [2025-03-08 16:21:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:07,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:21:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:21:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:21:07,152 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:07,195 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2025-03-08 16:21:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:21:07,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-08 16:21:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:07,199 INFO L225 Difference]: With dead ends: 186 [2025-03-08 16:21:07,201 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 16:21:07,201 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-08 16:21:07,202 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 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-08 16:21:07,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 16:21:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-08 16:21:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-08 16:21:07,216 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2025-03-08 16:21:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:07,217 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-08 16:21:07,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-08 16:21:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:07,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:07,220 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:07,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:21:07,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1855086248, now seen corresponding path program 1 times [2025-03-08 16:21:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106794941] [2025-03-08 16:21:07,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:07,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106794941] [2025-03-08 16:21:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106794941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:07,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:21:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968701856] [2025-03-08 16:21:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:21:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:07,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:21:07,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:21:07,403 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:07,431 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-03-08 16:21:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:21:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-08 16:21:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:07,433 INFO L225 Difference]: With dead ends: 190 [2025-03-08 16:21:07,433 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 16:21:07,433 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-08 16:21:07,434 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:07,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 16:21:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 16:21:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-08 16:21:07,441 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2025-03-08 16:21:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:07,442 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-08 16:21:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-08 16:21:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:07,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:07,446 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:07,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:21:07,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1854162727, now seen corresponding path program 1 times [2025-03-08 16:21:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646438653] [2025-03-08 16:21:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:07,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:07,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:07,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:07,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:07,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646438653] [2025-03-08 16:21:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646438653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:07,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:07,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:21:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117789705] [2025-03-08 16:21:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:07,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:21:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:07,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:21:07,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:21:07,746 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:07,908 INFO L93 Difference]: Finished difference Result 283 states and 407 transitions. [2025-03-08 16:21:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:21:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-08 16:21:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:07,912 INFO L225 Difference]: With dead ends: 283 [2025-03-08 16:21:07,912 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 16:21:07,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:07,915 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 119 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:07,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 656 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:21:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 16:21:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 108. [2025-03-08 16:21:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-08 16:21:07,923 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 136 [2025-03-08 16:21:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:07,923 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-08 16:21:07,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-08 16:21:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:07,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:07,924 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:07,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:21:07,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1935245944, now seen corresponding path program 1 times [2025-03-08 16:21:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334891260] [2025-03-08 16:21:07,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:07,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:08,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:08,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:08,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334891260] [2025-03-08 16:21:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334891260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:21:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733079644] [2025-03-08 16:21:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:09,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:09,095 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:09,260 INFO L93 Difference]: Finished difference Result 217 states and 310 transitions. [2025-03-08 16:21:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:21:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 16:21:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:09,262 INFO L225 Difference]: With dead ends: 217 [2025-03-08 16:21:09,263 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:21:09,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:09,264 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 91 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:09,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 441 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:21:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:21:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:21:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-03-08 16:21:09,276 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 136 [2025-03-08 16:21:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:09,276 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-03-08 16:21:09,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-03-08 16:21:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:21:09,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:09,281 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:09,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:21:09,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1590937034, now seen corresponding path program 1 times [2025-03-08 16:21:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:09,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072530736] [2025-03-08 16:21:09,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:09,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:21:09,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:21:09,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072530736] [2025-03-08 16:21:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072530736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:10,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:21:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870388143] [2025-03-08 16:21:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:21:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:10,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:21:10,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:21:10,448 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:21:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:10,830 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2025-03-08 16:21:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:21:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-03-08 16:21:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:10,831 INFO L225 Difference]: With dead ends: 275 [2025-03-08 16:21:10,831 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 16:21:10,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:21:10,832 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 95 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:10,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 960 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:21:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 16:21:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2025-03-08 16:21:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2025-03-08 16:21:10,846 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 138 [2025-03-08 16:21:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:10,848 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2025-03-08 16:21:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:21:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2025-03-08 16:21:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:21:10,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:10,850 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:21:10,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1751834886, now seen corresponding path program 1 times [2025-03-08 16:21:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099967047] [2025-03-08 16:21:10,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:10,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:21:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:21:10,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:10,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:21:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006079857] [2025-03-08 16:21:10,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:10,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:10,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:10,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:21:11,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:21:11,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:21:11,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:11,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:21:11,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:21:11,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:21:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:21:11,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:11,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:21:11,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:21:11,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:21:11,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:21:11,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:21:11,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 16:21:11,598 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:11,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:21:11,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:21:11 BoogieIcfgContainer [2025-03-08 16:21:11,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:21:11,669 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:21:11,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:21:11,669 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:21:11,670 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:05" (3/4) ... [2025-03-08 16:21:11,673 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:21:11,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:21:11,676 INFO L158 Benchmark]: Toolchain (without parser) took 6560.27ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 126.6MB in the beginning and 262.8MB in the end (delta: -136.1MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2025-03-08 16:21:11,677 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:11,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.98ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 111.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:21:11,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.33ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 107.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:11,678 INFO L158 Benchmark]: Boogie Preprocessor took 56.82ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.2MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:21:11,678 INFO L158 Benchmark]: IcfgBuilder took 570.09ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 71.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:21:11,678 INFO L158 Benchmark]: TraceAbstraction took 5672.17ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 70.7MB in the beginning and 267.0MB in the end (delta: -196.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-03-08 16:21:11,678 INFO L158 Benchmark]: Witness Printer took 6.18ms. Allocated memory is still 402.7MB. Free memory was 267.0MB in the beginning and 262.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:11,679 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.98ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 111.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.33ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 107.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.82ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.2MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 570.09ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 71.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5672.17ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 70.7MB in the beginning and 267.0MB in the end (delta: -196.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 6.18ms. Allocated memory is still 402.7MB. Free memory was 267.0MB in the beginning and 262.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 5.95 }; [L25-L27] double double_Array_0[1] = { 5.95 }; [L28-L30] float float_Array_0[2] = { 2.25, 16.875 }; [L28-L30] float float_Array_0[2] = { 2.25, 16.875 }; [L28-L30] float float_Array_0[2] = { 2.25, 16.875 }; [L31-L33] signed char signed_char_Array_0[2] = { -4, 10 }; [L31-L33] signed char signed_char_Array_0[2] = { -4, 10 }; [L31-L33] signed char signed_char_Array_0[2] = { -4, 10 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -100 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -100 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L40] signed long int last_1_signed_long_int_Array_0_0_ = -100; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR signed_long_int_Array_0[0] [L98] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] EXPR double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] CALL assume_abort_if_not(double_Array_0[0] != 0.0F) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] RET assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] float_Array_0[1] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L77] EXPR float_Array_0[1] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L79] EXPR signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 127) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] EXPR 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 127) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 254) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[4] >= 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[4] <= 254) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[4] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] unsigned_char_Array_0[5] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[5] >= 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[5] <= 127) 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] EXPR float_Array_0[1] [L44] float_Array_0[0] = float_Array_0[1] [L45] EXPR signed_char_Array_0[1] [L45] signed_char_Array_0[0] = signed_char_Array_0[1] [L46] EXPR float_Array_0[0] [L46] EXPR double_Array_0[0] [L46] EXPR 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L46] COND FALSE !((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) [L49] EXPR float_Array_0[0] [L49] EXPR double_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L49] COND TRUE float_Array_0[0] <= double_Array_0[0] [L50] signed_long_int_Array_0[0] = 256 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L55] EXPR signed_long_int_Array_0[0] [L55] EXPR signed_char_Array_0[0] [L55] EXPR signed_long_int_Array_0[0] [L55] signed long int stepLocal_0 = (signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]; [L56] EXPR signed_char_Array_0[0] [L56] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]) [L56] EXPR signed_long_int_Array_0[0] [L56] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=-65536, unsigned_char_Array_0={9:0}] [L56] COND TRUE stepLocal_0 < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]))) [L57] EXPR unsigned_char_Array_0[2] [L57] unsigned_char_Array_0[6] = unsigned_char_Array_0[2] [L61] EXPR unsigned_char_Array_0[6] [L61] EXPR unsigned_char_Array_0[1] [L61] EXPR unsigned_char_Array_0[5] [L61] (unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L61] (unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0] [L61] EXPR BOOL_unsigned_char_Array_0[0] [L61] (unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L61] COND FALSE !((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) [L66] EXPR unsigned_char_Array_0[4] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[4] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR signed_char_Array_0[0] [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR signed_char_Array_0[0] [L101] 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) [L101] EXPR unsigned_char_Array_0[6] [L101] EXPR unsigned_char_Array_0[2] [L101] EXPR (((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0])))) [L101] EXPR float_Array_0[0] [L101] EXPR double_Array_0[0] [L101] EXPR 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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR signed_char_Array_0[0] [L101] EXPR unsigned_char_Array_0[2] [L101] EXPR signed_char_Array_0[0] [L101] EXPR ((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101-L102] return (((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9: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_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 157 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 7, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 2965 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2137 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 636 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 828 mSDtfsCounter, 636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 110 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 3776/3808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:21:11,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.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 c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:21:13,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:21:13,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:21:13,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:21:13,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:21:13,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:21:13,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:21:13,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:21:13,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:21:13,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:21:13,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:21:13,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:21:13,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:21:13,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:21:13,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:13,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:21:13,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:21:13,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:21:13,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:21:13,624 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:21:13,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:21:13,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:21:13,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:21:13,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:21:13,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:21:13,625 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 -> c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 [2025-03-08 16:21:13,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:21:13,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:21:13,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:21:13,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:21:13,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:21:13,880 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-75.i [2025-03-08 16:21:15,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7ecaabb/9627d2e2e6334309a78ad27d865d927c/FLAG715b5e414 [2025-03-08 16:21:15,249 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:21:15,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i [2025-03-08 16:21:15,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7ecaabb/9627d2e2e6334309a78ad27d865d927c/FLAG715b5e414 [2025-03-08 16:21:15,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7ecaabb/9627d2e2e6334309a78ad27d865d927c [2025-03-08 16:21:15,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:21:15,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:21:15,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:15,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:21:15,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:21:15,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e95dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15, skipping insertion in model container [2025-03-08 16:21:15,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:21:15,398 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-75.i[916,929] [2025-03-08 16:21:15,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:15,468 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:21:15,476 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-75.i[916,929] [2025-03-08 16:21:15,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:15,540 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:21:15,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15 WrapperNode [2025-03-08 16:21:15,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:15,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:15,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:21:15,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:21:15,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,599 INFO L138 Inliner]: procedures = 36, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-03-08 16:21:15,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:15,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:21:15,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:21:15,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:21:15,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,646 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 8, 11, 17, 21, 16, 56]. 43 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 2, 2, 1, 7]. The 18 writes are split as follows [0, 1, 1, 2, 2, 3, 9]. [2025-03-08 16:21:15,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:21:15,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:21:15,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:21:15,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:21:15,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (1/1) ... [2025-03-08 16:21:15,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:15,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:21:15,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:21:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:21:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:21:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:21:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:21:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:21:15,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:21:15,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:21:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:21:15,880 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:21:15,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:21:35,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-03-08 16:21:35,464 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-08 16:21:35,464 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:21:35,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:21:35,477 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:21:35,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:35 BoogieIcfgContainer [2025-03-08 16:21:35,478 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:21:35,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:21:35,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:21:35,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:21:35,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:21:15" (1/3) ... [2025-03-08 16:21:35,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ce5011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:35, skipping insertion in model container [2025-03-08 16:21:35,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:15" (2/3) ... [2025-03-08 16:21:35,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ce5011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:35, skipping insertion in model container [2025-03-08 16:21:35,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:35" (3/3) ... [2025-03-08 16:21:35,486 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-75.i [2025-03-08 16:21:35,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:21:35,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-75.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:21:35,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:21:35,538 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;@6cf583f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:21:35,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:21:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:35,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:35,549 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:35,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:35,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -295753078, now seen corresponding path program 1 times [2025-03-08 16:21:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004033086] [2025-03-08 16:21:35,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:35,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:35,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:35,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:21:35,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:36,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:36,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:36,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:36,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:21:36,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 16:21:36,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:36,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:36,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004033086] [2025-03-08 16:21:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004033086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:21:36,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259342794] [2025-03-08 16:21:36,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:21:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:21:37,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:37,009 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:37,026 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2025-03-08 16:21:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:21:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 16:21:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:37,032 INFO L225 Difference]: With dead ends: 186 [2025-03-08 16:21:37,032 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:21:37,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:37,052 INFO L435 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:37,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:21:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 16:21:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-08 16:21:37,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2025-03-08 16:21:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-08 16:21:37,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-08 16:21:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:37,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:37,089 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:37,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:21:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:37,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:37,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1552377367, now seen corresponding path program 1 times [2025-03-08 16:21:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:37,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973708995] [2025-03-08 16:21:37,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:37,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-08 16:21:37,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:37,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:37,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:21:37,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:38,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:38,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:38,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:38,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:21:38,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:39,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:39,318 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:39,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973708995] [2025-03-08 16:21:39,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973708995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:39,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:39,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:21:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004959866] [2025-03-08 16:21:39,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:39,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:21:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:39,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:21:39,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:21:39,321 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:40,087 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2025-03-08 16:21:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:21:40,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-08 16:21:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:40,089 INFO L225 Difference]: With dead ends: 188 [2025-03-08 16:21:40,090 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 16:21:40,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:21:40,090 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:40,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:21:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 16:21:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 16:21:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-08 16:21:40,097 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2025-03-08 16:21:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:40,098 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-08 16:21:40,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-08 16:21:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:40,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:40,100 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:40,130 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-08 16:21:40,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:40,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:40,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1855086248, now seen corresponding path program 1 times [2025-03-08 16:21:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334571022] [2025-03-08 16:21:40,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:40,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:40,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:21:40,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:41,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:41,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:41,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:41,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:21:41,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:42,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:42,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:42,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334571022] [2025-03-08 16:21:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334571022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:42,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:21:42,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595463914] [2025-03-08 16:21:42,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:42,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:42,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:42,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:42,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:42,642 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:43,800 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-03-08 16:21:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:21:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-08 16:21:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:43,801 INFO L225 Difference]: With dead ends: 194 [2025-03-08 16:21:43,802 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 16:21:43,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:43,803 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:43,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:21:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 16:21:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-08 16:21:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-08 16:21:43,809 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2025-03-08 16:21:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-08 16:21:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-08 16:21:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:21:43,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:43,812 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:43,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:21:44,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:44,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1854162727, now seen corresponding path program 1 times [2025-03-08 16:21:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736492813] [2025-03-08 16:21:44,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:44,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:44,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:44,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:44,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:21:44,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:21:45,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:21:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:45,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:21:45,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:48,091 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 60 treesize of output 32 [2025-03-08 16:21:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:49,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:49,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736492813] [2025-03-08 16:21:49,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736492813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:49,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:21:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353437121] [2025-03-08 16:21:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:49,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:49,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:49,522 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:54,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:21:58,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:02,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:06,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:15,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:19,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:23,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:27,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:31,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:35,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:39,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:43,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []