./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:04:10,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:04:10,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:04:10,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:04:10,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:04:10,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:04:10,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:04:10,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:04:10,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:04:10,206 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:04:10,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:04:10,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:04:10,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:04:10,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:04:10,207 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:04:10,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:04:10,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:04:10,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:04:10,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:04:10,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:04:10,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:04:10,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:04:10,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2025-02-06 04:04:10,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:04:10,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:04:10,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:04:10,515 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:04:10,516 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:04:10,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-02-06 04:04:11,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e67aebc0/4d250392e9794fd299050769195bed31/FLAGf95173215 [2025-02-06 04:04:12,081 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:04:12,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-02-06 04:04:12,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e67aebc0/4d250392e9794fd299050769195bed31/FLAGf95173215 [2025-02-06 04:04:12,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e67aebc0/4d250392e9794fd299050769195bed31 [2025-02-06 04:04:12,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:04:12,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:04:12,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:04:12,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:04:12,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:04:12,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22beacaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12, skipping insertion in model container [2025-02-06 04:04:12,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:04:12,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-02-06 04:04:12,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:04:12,332 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:04:12,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-02-06 04:04:12,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:04:12,396 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:04:12,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12 WrapperNode [2025-02-06 04:04:12,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:04:12,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:04:12,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:04:12,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:04:12,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,443 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-02-06 04:04:12,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:04:12,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:04:12,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:04:12,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:04:12,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,473 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-02-06 04:04:12,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:04:12,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:04:12,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:04:12,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:04:12,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (1/1) ... [2025-02-06 04:04:12,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:04:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:04:12,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:04:12,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:04:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:04:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 04:04:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 04:04:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:04:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:04:12,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:04:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:04:12,680 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:04:12,682 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:04:13,086 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-02-06 04:04:13,122 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-02-06 04:04:13,122 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:04:13,134 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:04:13,135 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:04:13,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:13 BoogieIcfgContainer [2025-02-06 04:04:13,136 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:04:13,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:04:13,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:04:13,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:04:13,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:04:12" (1/3) ... [2025-02-06 04:04:13,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d1ee99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:04:13, skipping insertion in model container [2025-02-06 04:04:13,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:12" (2/3) ... [2025-02-06 04:04:13,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d1ee99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:04:13, skipping insertion in model container [2025-02-06 04:04:13,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:13" (3/3) ... [2025-02-06 04:04:13,144 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2025-02-06 04:04:13,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:04:13,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:04:13,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:04:13,222 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;@64360cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:04:13,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:04:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:13,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:13,239 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:13,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:13,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-02-06 04:04:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920181526] [2025-02-06 04:04:13,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:13,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:13,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:13,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:13,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 04:04:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920181526] [2025-02-06 04:04:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920181526] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227800706] [2025-02-06 04:04:13,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:04:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:04:13,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:04:13,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:04:13,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:13,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:13,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:13,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:13,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:04:13,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 04:04:13,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:13,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227800706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:13,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:04:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:04:13,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737901734] [2025-02-06 04:04:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:04:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:13,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:04:13,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:04:13,816 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 04:04:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:13,838 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-02-06 04:04:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:04:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-02-06 04:04:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:13,844 INFO L225 Difference]: With dead ends: 184 [2025-02-06 04:04:13,844 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 04:04:13,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:04:13,849 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:13,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 04:04:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 04:04:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-06 04:04:13,889 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-02-06 04:04:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-06 04:04:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 04:04:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-06 04:04:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:13,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:13,893 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:13,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:04:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:04:14,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:14,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-02-06 04:04:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510185215] [2025-02-06 04:04:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:14,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:14,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:14,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:14,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:14,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510185215] [2025-02-06 04:04:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510185215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:14,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:14,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:04:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602110054] [2025-02-06 04:04:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:04:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:14,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:04:14,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:04:14,366 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:14,412 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2025-02-06 04:04:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:04:14,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:14,414 INFO L225 Difference]: With dead ends: 184 [2025-02-06 04:04:14,417 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 04:04:14,418 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-02-06 04:04:14,419 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:14,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 04:04:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-02-06 04:04:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-02-06 04:04:14,434 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2025-02-06 04:04:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:14,435 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-02-06 04:04:14,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-02-06 04:04:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:14,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:14,443 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:14,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:04:14,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:14,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-02-06 04:04:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:14,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122135366] [2025-02-06 04:04:14,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:14,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:14,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122135366] [2025-02-06 04:04:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122135366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:04:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892634095] [2025-02-06 04:04:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:04:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:14,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:04:14,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:04:14,894 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:15,120 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2025-02-06 04:04:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:04:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:15,122 INFO L225 Difference]: With dead ends: 227 [2025-02-06 04:04:15,122 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 04:04:15,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:04:15,124 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:15,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 367 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:04:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 04:04:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2025-02-06 04:04:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2025-02-06 04:04:15,132 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 84 [2025-02-06 04:04:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:15,133 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2025-02-06 04:04:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2025-02-06 04:04:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:15,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:15,135 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:04:15,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:15,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -562947685, now seen corresponding path program 1 times [2025-02-06 04:04:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925558186] [2025-02-06 04:04:15,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:15,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:15,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:15,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 04:04:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925558186] [2025-02-06 04:04:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925558186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072770736] [2025-02-06 04:04:15,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:15,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:04:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:04:15,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:04:15,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:04:15,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:15,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:15,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:15,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:15,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:04:15,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:15,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:15,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072770736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:15,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:04:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 04:04:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044175475] [2025-02-06 04:04:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:04:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:15,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:04:15,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:04:15,573 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:15,607 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2025-02-06 04:04:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:04:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:15,610 INFO L225 Difference]: With dead ends: 194 [2025-02-06 04:04:15,610 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 04:04:15,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:04:15,614 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:15,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 04:04:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 04:04:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2025-02-06 04:04:15,624 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 84 [2025-02-06 04:04:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:15,625 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2025-02-06 04:04:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2025-02-06 04:04:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:15,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:15,630 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:15,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:04:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:04:15,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-02-06 04:04:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790618331] [2025-02-06 04:04:15,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:15,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:15,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:15,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:15,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 04:04:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790618331] [2025-02-06 04:04:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790618331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922155627] [2025-02-06 04:04:16,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:16,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:04:16,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:04:16,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:04:16,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:04:16,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:16,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:16,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:16,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:16,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:04:16,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:16,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:16,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922155627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:16,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:04:16,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 04:04:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390299952] [2025-02-06 04:04:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:04:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:16,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:04:16,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:04:16,218 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:16,251 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-02-06 04:04:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:04:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:16,252 INFO L225 Difference]: With dead ends: 200 [2025-02-06 04:04:16,253 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 04:04:16,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:04:16,254 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:16,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 04:04:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-02-06 04:04:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-02-06 04:04:16,264 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 84 [2025-02-06 04:04:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:16,265 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-02-06 04:04:16,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-02-06 04:04:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:16,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:16,268 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:16,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:04:16,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:04:16,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:16,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-02-06 04:04:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:16,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271575061] [2025-02-06 04:04:16,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:16,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:16,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:04:16,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:04:16,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:16,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:16,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:16,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:04:16,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:04:16,709 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:04:16,709 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:04:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:04:16,716 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 04:04:16,826 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:04:16,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:04:16 BoogieIcfgContainer [2025-02-06 04:04:16,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:04:16,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:04:16,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:04:16,831 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:04:16,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:13" (3/4) ... [2025-02-06 04:04:16,833 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:04:16,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:04:16,835 INFO L158 Benchmark]: Toolchain (without parser) took 4729.94ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 91.7MB in the end (delta: 20.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-02-06 04:04:16,835 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:16,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.21ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:04:16,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:16,836 INFO L158 Benchmark]: Boogie Preprocessor took 46.28ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:16,836 INFO L158 Benchmark]: IcfgBuilder took 644.30ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 63.7MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:04:16,836 INFO L158 Benchmark]: TraceAbstraction took 3692.41ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 91.7MB in the end (delta: -28.5MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-02-06 04:04:16,836 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 91.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:16,838 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.36ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.21ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.28ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 644.30ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 63.7MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3692.41ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 91.7MB in the end (delta: -28.5MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 91.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 74. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L47] signed char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L48] signed char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L49] signed char* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L50] signed long int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] unsigned char* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] unsigned char* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] double* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct0.var_1_12 [L101] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L85] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_8 [L86] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L90] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L91] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L93] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L96] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L97] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L98] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L112] RET updateVariables() [L113] CALL step() [L58] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L63] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L63] (*(WrapperStruct0_var_1_9_Pointer)) = (*(WrapperStruct0_var_1_10_Pointer)) [L65] EXPR \read(*WrapperStruct0_var_1_13_Pointer) [L65] unsigned char stepLocal_0 = ! (*(WrapperStruct0_var_1_13_Pointer)); [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) [L66] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L66] stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L66] COND FALSE !(stepLocal_0 || (*(WrapperStruct0_var_1_14_Pointer))) [L73] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L73] (*(WrapperStruct0_var_1_15_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L74] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L74] COND FALSE !((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) [L79] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L79] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer)) [L80] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L80] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_8_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_15_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR ((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104] EXPR (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L104-L105] return (((((*(WrapperStruct0_var_1_15_Pointer)) <= (*(WrapperStruct0_var_1_15_Pointer))) ? ((((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_12_Pointer))) >= ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct0_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_8_Pointer))))))) : 1) : (((*(WrapperStruct0_var_1_12_Pointer)) > (*(WrapperStruct0_var_1_9_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer)) + (*(WrapperStruct0_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct0_var_1_9_Pointer)) == ((signed char) (*(WrapperStruct0_var_1_10_Pointer)))))) && (((! (*(WrapperStruct0_var_1_13_Pointer))) || (*(WrapperStruct0_var_1_14_Pointer))) ? ((! (*(WrapperStruct0_var_1_14_Pointer))) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) ((((((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) < 0 ) ? -(((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) : (((((*(WrapperStruct0_var_1_9_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_9_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_9_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_15_Pointer)) == ((double) (*(WrapperStruct0_var_1_8_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:17}, WrapperStruct0_var_1_11_Pointer={4:18}, WrapperStruct0_var_1_12_Pointer={4:19}, WrapperStruct0_var_1_13_Pointer={4:23}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_15_Pointer={4:25}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_8_Pointer={4:8}, WrapperStruct0_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1908 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1269 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 639 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=5, InterpolantAutomatonStates: 21, 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, 5 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 1118/1152 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 04:04:16,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:04:19,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:04:19,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 04:04:19,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:04:19,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:04:19,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:04:19,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:04:19,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:04:19,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:04:19,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:04:19,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:04:19,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:04:19,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:04:19,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:04:19,308 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:04:19,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:04:19,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:04:19,309 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:04:19,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:04:19,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:04:19,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:04:19,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:04:19,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:04:19,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:04:19,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:04:19,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:04:19,312 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 221b5a6bbea2d3affa28d277422c6c16e25871b0f2e6dd0968bfbdc5b5eb82af [2025-02-06 04:04:19,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:04:19,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:04:19,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:04:19,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:04:19,659 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:04:19,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-02-06 04:04:20,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f3913034/63e9ab2dbc3149e5a4923bb08440d3f7/FLAGd8f2ad71d [2025-02-06 04:04:21,166 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:04:21,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i [2025-02-06 04:04:21,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f3913034/63e9ab2dbc3149e5a4923bb08440d3f7/FLAGd8f2ad71d [2025-02-06 04:04:21,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f3913034/63e9ab2dbc3149e5a4923bb08440d3f7 [2025-02-06 04:04:21,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:04:21,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:04:21,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:04:21,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:04:21,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:04:21,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ba1bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21, skipping insertion in model container [2025-02-06 04:04:21,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:04:21,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-02-06 04:04:21,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:04:21,449 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:04:21,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-47.i[917,930] [2025-02-06 04:04:21,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:04:21,528 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:04:21,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21 WrapperNode [2025-02-06 04:04:21,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:04:21,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:04:21,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:04:21,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:04:21,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,593 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2025-02-06 04:04:21,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:04:21,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:04:21,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:04:21,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:04:21,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,644 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-02-06 04:04:21,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:04:21,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:04:21,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:04:21,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:04:21,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (1/1) ... [2025-02-06 04:04:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:04:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:04:21,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:04:21,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:04:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:04:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 04:04:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 04:04:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 04:04:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 04:04:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:04:21,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:04:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:04:21,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:04:21,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:04:21,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:04:21,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:04:21,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:04:21,869 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:04:21,871 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:04:22,414 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-02-06 04:04:22,457 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-02-06 04:04:22,458 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:04:22,467 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:04:22,467 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:04:22,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:22 BoogieIcfgContainer [2025-02-06 04:04:22,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:04:22,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:04:22,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:04:22,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:04:22,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:04:21" (1/3) ... [2025-02-06 04:04:22,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15736671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:04:22, skipping insertion in model container [2025-02-06 04:04:22,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:21" (2/3) ... [2025-02-06 04:04:22,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15736671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:04:22, skipping insertion in model container [2025-02-06 04:04:22,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:22" (3/3) ... [2025-02-06 04:04:22,478 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-47.i [2025-02-06 04:04:22,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:04:22,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:04:22,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:04:22,545 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;@286e1723, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:04:22,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:04:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:22,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:22,556 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:22,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:22,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-02-06 04:04:22,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672426193] [2025-02-06 04:04:22,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:22,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:22,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 04:04:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:22,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:22,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:22,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:22,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:04:22,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 04:04:22,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:22,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672426193] [2025-02-06 04:04:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672426193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:22,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:04:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956456673] [2025-02-06 04:04:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:22,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:04:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:22,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:04:22,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:04:22,913 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 04:04:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:22,938 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-02-06 04:04:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:04:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-02-06 04:04:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:22,944 INFO L225 Difference]: With dead ends: 184 [2025-02-06 04:04:22,945 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 04:04:22,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:04:22,949 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:22,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 04:04:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 04:04:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-06 04:04:22,989 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-02-06 04:04:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-06 04:04:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 04:04:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-06 04:04:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:22,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:22,993 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:23,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:04:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:23,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-02-06 04:04:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568797261] [2025-02-06 04:04:23,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:23,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:23,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:23,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 04:04:23,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:23,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:23,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:23,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:04:23,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:23,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:23,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:23,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568797261] [2025-02-06 04:04:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568797261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:23,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:04:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361041793] [2025-02-06 04:04:23,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:23,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:04:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:23,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:04:23,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:04:23,532 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:23,605 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2025-02-06 04:04:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:04:23,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:23,607 INFO L225 Difference]: With dead ends: 186 [2025-02-06 04:04:23,607 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 04:04:23,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:04:23,608 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:23,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 04:04:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-02-06 04:04:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-02-06 04:04:23,617 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2025-02-06 04:04:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-02-06 04:04:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-02-06 04:04:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:23,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:23,621 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:23,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 04:04:23,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:23,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-02-06 04:04:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24307377] [2025-02-06 04:04:23,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:23,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:23,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 04:04:23,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:24,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:24,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:24,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:04:24,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:24,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:04:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 46 [2025-02-06 04:04:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:24,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:24,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24307377] [2025-02-06 04:04:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24307377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:04:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511044813] [2025-02-06 04:04:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:24,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:04:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:24,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:04:24,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:04:24,331 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:26,653 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2025-02-06 04:04:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:04:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:26,655 INFO L225 Difference]: With dead ends: 231 [2025-02-06 04:04:26,656 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 04:04:26,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:04:26,657 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 57 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:26,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 335 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 04:04:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 04:04:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2025-02-06 04:04:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-02-06 04:04:26,665 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2025-02-06 04:04:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:26,666 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-02-06 04:04:26,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-02-06 04:04:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:26,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:26,669 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:26,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 04:04:26,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:26,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:26,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-02-06 04:04:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746591290] [2025-02-06 04:04:26,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:26,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:26,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:26,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:26,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 04:04:26,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:27,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:27,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:04:27,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:27,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:27,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746591290] [2025-02-06 04:04:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746591290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:27,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:27,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:04:27,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696007785] [2025-02-06 04:04:27,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:27,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:04:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:27,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:04:27,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:04:27,099 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:27,135 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-02-06 04:04:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:04:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:27,139 INFO L225 Difference]: With dead ends: 196 [2025-02-06 04:04:27,140 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 04:04:27,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:04:27,141 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:27,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 04:04:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 04:04:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 04:04:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-02-06 04:04:27,154 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 84 [2025-02-06 04:04:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:27,154 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-02-06 04:04:27,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-02-06 04:04:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:27,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:27,156 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:27,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:04:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:27,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:27,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-02-06 04:04:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:27,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623764255] [2025-02-06 04:04:27,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:27,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:27,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:27,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:27,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 04:04:27,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:27,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:27,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:27,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:27,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 04:04:27,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:27,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 04:04:28,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-02-06 04:04:29,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-02-06 04:04:29,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2025-02-06 04:04:30,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2025-02-06 04:04:30,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 77 [2025-02-06 04:04:31,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:04:31,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 70 [2025-02-06 04:04:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 04:04:31,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:04:31,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623764255] [2025-02-06 04:04:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623764255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2084400048] [2025-02-06 04:04:31,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:04:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:04:31,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:04:31,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-06 04:04:31,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:33,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:33,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:33,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 04:04:33,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:33,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 04:04:34,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-02-06 04:04:35,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-02-06 04:04:36,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-02-06 04:04:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-02-06 04:04:37,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-02-06 04:04:37,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2025-02-06 04:04:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-06 04:04:38,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:04:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2084400048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:39,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:04:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2025-02-06 04:04:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863448206] [2025-02-06 04:04:39,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:04:39,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:04:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:04:39,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:04:39,250 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 04:04:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:44,320 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2025-02-06 04:04:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:04:44,321 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 84 [2025-02-06 04:04:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:44,323 INFO L225 Difference]: With dead ends: 301 [2025-02-06 04:04:44,323 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 04:04:44,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 186 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 04:04:44,324 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 747 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:44,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 817 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 04:04:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 04:04:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 143. [2025-02-06 04:04:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 120 states have internal predecessors, (161), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:04:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 197 transitions. [2025-02-06 04:04:44,350 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 197 transitions. Word has length 84 [2025-02-06 04:04:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:44,350 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 197 transitions. [2025-02-06 04:04:44,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 18 states have internal predecessors, (78), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 04:04:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 197 transitions. [2025-02-06 04:04:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 04:04:44,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:44,351 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:44,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-02-06 04:04:44,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 04:04:44,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:44,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 911590556, now seen corresponding path program 1 times [2025-02-06 04:04:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:44,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776404948] [2025-02-06 04:04:44,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:44,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:44,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:44,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:44,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 04:04:44,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 04:04:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 04:04:44,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:44,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:04:44,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 04:04:44,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:44,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:44,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776404948] [2025-02-06 04:04:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776404948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:44,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:44,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:04:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821968752] [2025-02-06 04:04:44,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:44,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:04:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:44,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:04:44,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:04:44,946 INFO L87 Difference]: Start difference. First operand 143 states and 197 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:45,015 INFO L93 Difference]: Finished difference Result 283 states and 391 transitions. [2025-02-06 04:04:45,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:04:45,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-02-06 04:04:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:45,018 INFO L225 Difference]: With dead ends: 283 [2025-02-06 04:04:45,018 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 04:04:45,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-02-06 04:04:45,020 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:45,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:04:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 04:04:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-06 04:04:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 120 states have internal predecessors, (160), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:04:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2025-02-06 04:04:45,043 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 84 [2025-02-06 04:04:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:45,043 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2025-02-06 04:04:45,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 04:04:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2025-02-06 04:04:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 04:04:45,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:45,045 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:45,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-02-06 04:04:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:45,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:45,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -293158356, now seen corresponding path program 1 times [2025-02-06 04:04:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:45,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616284507] [2025-02-06 04:04:45,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:04:45,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:45,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:04:45,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 04:04:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 04:04:45,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 04:04:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:45,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 04:04:45,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 04:04:46,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-02-06 04:04:46,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2025-02-06 04:04:47,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-02-06 04:04:47,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-02-06 04:04:48,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-02-06 04:04:48,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 66 [2025-02-06 04:04:48,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:04:48,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 66 [2025-02-06 04:04:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:04:48,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:04:49,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616284507] [2025-02-06 04:04:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616284507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1133593550] [2025-02-06 04:04:49,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:04:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:04:49,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:04:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-02-06 04:04:49,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 04:04:50,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 04:04:50,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:50,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 04:04:50,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:50,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-02-06 04:04:52,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 59 [2025-02-06 04:04:52,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 67 [2025-02-06 04:04:53,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 84 [2025-02-06 04:04:54,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 95 [2025-02-06 04:04:55,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98 [2025-02-06 04:04:55,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98 [2025-02-06 04:04:56,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 135 [2025-02-06 04:04:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 56 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 04:04:56,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:04:58,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1133593550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:04:58,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:04:58,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2025-02-06 04:04:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154119263] [2025-02-06 04:04:58,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:04:58,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 04:04:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:58,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 04:04:58,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2025-02-06 04:04:58,230 INFO L87 Difference]: Start difference. First operand 143 states and 196 transitions. Second operand has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 22 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 04:05:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:05:03,369 INFO L93 Difference]: Finished difference Result 349 states and 479 transitions. [2025-02-06 04:05:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:05:03,370 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 22 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 85 [2025-02-06 04:05:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:05:03,372 INFO L225 Difference]: With dead ends: 349 [2025-02-06 04:05:03,372 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 04:05:03,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 184 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 04:05:03,373 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1030 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:05:03,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 764 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 04:05:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 04:05:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 155. [2025-02-06 04:05:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 131 states have internal predecessors, (176), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 04:05:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2025-02-06 04:05:03,395 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 85 [2025-02-06 04:05:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:05:03,395 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2025-02-06 04:05:03,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 22 states have internal predecessors, (86), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 04:05:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2025-02-06 04:05:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 04:05:03,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:05:03,399 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:05:03,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 04:05:03,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-02-06 04:05:03,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 04:05:03,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:05:03,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:05:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -158299719, now seen corresponding path program 1 times [2025-02-06 04:05:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:05:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102239562] [2025-02-06 04:05:03,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:05:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:05:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:05:03,802 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:05:03,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 04:05:03,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 04:05:04,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 04:05:04,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:05:04,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:05:04,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 04:05:04,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:05:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 04:05:04,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 61 [2025-02-06 04:05:05,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-02-06 04:05:05,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-02-06 04:05:06,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-02-06 04:05:06,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2025-02-06 04:05:06,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:05:06,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 64 [2025-02-06 04:05:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 04:05:06,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:05:07,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:05:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102239562] [2025-02-06 04:05:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102239562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:05:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1157879858] [2025-02-06 04:05:07,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:05:07,154 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:05:07,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:05:07,157 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:05:07,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-02-06 04:05:07,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 04:05:08,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 04:05:08,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:05:08,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:05:08,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 04:05:08,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:05:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 04:05:11,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 69 [2025-02-06 04:05:11,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-02-06 04:05:12,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-02-06 04:05:13,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-02-06 04:05:13,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 04:05:17,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2025-02-06 04:05:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 04:05:17,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:05:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1157879858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:05:18,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:05:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-02-06 04:05:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258078801] [2025-02-06 04:05:18,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:05:18,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 04:05:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:05:18,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 04:05:18,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 04:05:18,515 INFO L87 Difference]: Start difference. First operand 155 states and 212 transitions. Second operand has 28 states, 26 states have (on average 3.269230769230769) internal successors, (85), 23 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 04:05:24,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:05:28,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:05:32,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:05:36,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]