./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:05:10,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:05:10,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:05:10,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:05:10,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:05:10,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:05:10,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:05:10,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:05:10,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:05:10,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:05:10,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:05:10,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:05:10,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:05:10,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:05:10,505 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:05:10,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:05:10,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:05:10,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:05:10,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:05:10,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:05:10,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:10,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:05:10,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:05:10,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:05:10,508 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a [2025-03-08 17:05:10,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:05:10,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:05:10,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:05:10,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:05:10,739 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:05:10,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i [2025-03-08 17:05:11,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569cb190b/000273d66cb14403b55b885ca1ff2f2b/FLAG51ace276a [2025-03-08 17:05:12,090 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:05:12,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i [2025-03-08 17:05:12,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569cb190b/000273d66cb14403b55b885ca1ff2f2b/FLAG51ace276a [2025-03-08 17:05:12,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569cb190b/000273d66cb14403b55b885ca1ff2f2b [2025-03-08 17:05:12,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:05:12,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:05:12,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:12,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:05:12,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:05:12,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132efbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12, skipping insertion in model container [2025-03-08 17:05:12,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:05:12,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i[917,930] [2025-03-08 17:05:12,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:12,625 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:05:12,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i[917,930] [2025-03-08 17:05:12,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:12,691 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:05:12,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12 WrapperNode [2025-03-08 17:05:12,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:12,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:12,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:05:12,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:05:12,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,741 INFO L138 Inliner]: procedures = 30, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-03-08 17:05:12,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:12,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:05:12,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:05:12,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:05:12,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,756 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:05:12,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:05:12,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:05:12,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:05:12,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:05:12,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (1/1) ... [2025-03-08 17:05:12,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:12,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:05:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:05:12,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:05:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:05:12,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:05:12,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:05:12,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:05:13,345 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite111#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite130#1;havoc property_#t~mem120#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-08 17:05:13,384 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-08 17:05:13,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:05:13,395 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:05:13,395 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:05:13,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:13 BoogieIcfgContainer [2025-03-08 17:05:13,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:05:13,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:05:13,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:05:13,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:05:13,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:05:12" (1/3) ... [2025-03-08 17:05:13,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22402b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:13, skipping insertion in model container [2025-03-08 17:05:13,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:12" (2/3) ... [2025-03-08 17:05:13,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22402b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:13, skipping insertion in model container [2025-03-08 17:05:13,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:13" (3/3) ... [2025-03-08 17:05:13,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-68.i [2025-03-08 17:05:13,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:05:13,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-68.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:05:13,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:05:13,465 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;@75de223f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:05:13,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:05:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:13,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:13,481 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:13,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:13,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 813634942, now seen corresponding path program 1 times [2025-03-08 17:05:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898189269] [2025-03-08 17:05:13,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:13,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:13,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 17:05:13,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:13,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898189269] [2025-03-08 17:05:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898189269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299494869] [2025-03-08 17:05:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:13,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:13,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:13,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:05:13,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:14,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:14,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:14,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:14,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:05:14,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 17:05:14,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299494869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:14,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:05:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192051357] [2025-03-08 17:05:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:05:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:14,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:05:14,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:14,107 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:14,145 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2025-03-08 17:05:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:05:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-03-08 17:05:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:14,153 INFO L225 Difference]: With dead ends: 220 [2025-03-08 17:05:14,154 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 17:05:14,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:14,159 INFO L435 NwaCegarLoop]: 160 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, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:14,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 17:05:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 17:05:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-08 17:05:14,189 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2025-03-08 17:05:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:14,190 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-08 17:05:14,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-08 17:05:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:14,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:14,193 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:14,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:05:14,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 17:05:14,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -911656629, now seen corresponding path program 1 times [2025-03-08 17:05:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318532043] [2025-03-08 17:05:14,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:14,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:14,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:14,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318532043] [2025-03-08 17:05:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318532043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203775365] [2025-03-08 17:05:14,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:14,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:14,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:14,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:14,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:05:15,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:15,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:15,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:15,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:15,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:15,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:15,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203775365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:15,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 17:05:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035084697] [2025-03-08 17:05:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:15,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:15,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:15,163 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:15,206 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-03-08 17:05:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:15,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:15,209 INFO L225 Difference]: With dead ends: 220 [2025-03-08 17:05:15,210 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 17:05:15,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:15,211 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:15,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 17:05:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-08 17:05:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2025-03-08 17:05:15,226 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2025-03-08 17:05:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:15,228 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2025-03-08 17:05:15,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2025-03-08 17:05:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:15,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:15,231 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:15,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:15,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 17:05:15,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1586359308, now seen corresponding path program 1 times [2025-03-08 17:05:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100492856] [2025-03-08 17:05:15,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:15,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:15,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:15,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100492856] [2025-03-08 17:05:15,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100492856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145708422] [2025-03-08 17:05:15,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:15,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:15,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:15,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:15,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:05:15,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:15,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:15,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:15,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:15,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:15,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145708422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:15,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 17:05:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696811610] [2025-03-08 17:05:15,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:15,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:15,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:15,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:15,995 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:16,030 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2025-03-08 17:05:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:16,032 INFO L225 Difference]: With dead ends: 224 [2025-03-08 17:05:16,032 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 17:05:16,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:16,033 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:16,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 17:05:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-08 17:05:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-08 17:05:16,045 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2025-03-08 17:05:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:16,046 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-08 17:05:16,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-08 17:05:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:16,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:16,050 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:16,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:16,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:16,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:16,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash -221095155, now seen corresponding path program 1 times [2025-03-08 17:05:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:16,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552820501] [2025-03-08 17:05:16,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:16,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:16,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:16,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:16,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:16,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552820501] [2025-03-08 17:05:16,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552820501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:16,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71696009] [2025-03-08 17:05:16,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:16,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:16,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:05:16,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:16,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:16,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:16,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:16,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:16,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:16,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71696009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 17:05:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849440757] [2025-03-08 17:05:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:16,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:16,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:16,708 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:16,726 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2025-03-08 17:05:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:16,730 INFO L225 Difference]: With dead ends: 228 [2025-03-08 17:05:16,730 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 17:05:16,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:16,732 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:16,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 17:05:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-03-08 17:05:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-08 17:05:16,740 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2025-03-08 17:05:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:16,740 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-08 17:05:16,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-08 17:05:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:16,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:16,744 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:16,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:16,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 666408526, now seen corresponding path program 1 times [2025-03-08 17:05:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257025698] [2025-03-08 17:05:16,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:16,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:16,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:16,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:16,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257025698] [2025-03-08 17:05:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257025698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312062980] [2025-03-08 17:05:17,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:17,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:17,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:05:17,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:17,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:17,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:05:17,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:17,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312062980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:17,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 17:05:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5225624] [2025-03-08 17:05:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:17,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:05:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:17,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:05:17,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:17,380 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:17,401 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-03-08 17:05:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:17,403 INFO L225 Difference]: With dead ends: 232 [2025-03-08 17:05:17,403 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 17:05:17,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:17,404 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:17,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 17:05:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-08 17:05:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-08 17:05:17,416 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 146 [2025-03-08 17:05:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:17,417 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-08 17:05:17,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-08 17:05:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:17,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:17,418 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:17,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:17,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:17,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 667332047, now seen corresponding path program 1 times [2025-03-08 17:05:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424373139] [2025-03-08 17:05:17,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:17,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:17,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:17,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:17,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424373139] [2025-03-08 17:05:17,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424373139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:17,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913267882] [2025-03-08 17:05:17,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:17,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:17,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:17,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:17,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:05:17,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:18,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:18,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:18,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:18,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:18,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913267882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:18,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:18,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 17:05:18,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71075427] [2025-03-08 17:05:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:18,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:18,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:18,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:18,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:18,043 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:18,071 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-08 17:05:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:18,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:18,073 INFO L225 Difference]: With dead ends: 236 [2025-03-08 17:05:18,073 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 17:05:18,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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-03-08 17:05:18,075 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 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-03-08 17:05:18,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 17:05:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 17:05:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2025-03-08 17:05:18,085 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 146 [2025-03-08 17:05:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:18,086 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2025-03-08 17:05:18,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2025-03-08 17:05:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:18,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:18,087 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:18,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 17:05:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:18,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -209993560, now seen corresponding path program 1 times [2025-03-08 17:05:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724465018] [2025-03-08 17:05:18,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:18,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:18,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:18,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:18,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724465018] [2025-03-08 17:05:18,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724465018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:18,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530888314] [2025-03-08 17:05:18,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:18,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:18,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:18,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:18,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 17:05:18,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:18,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:18,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:18,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:18,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:18,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530888314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:18,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 17:05:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929947813] [2025-03-08 17:05:18,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:18,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:18,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:18,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:18,781 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:18,805 INFO L93 Difference]: Finished difference Result 242 states and 343 transitions. [2025-03-08 17:05:18,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:18,808 INFO L225 Difference]: With dead ends: 242 [2025-03-08 17:05:18,808 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 17:05:18,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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-03-08 17:05:18,809 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 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-03-08 17:05:18,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 17:05:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-03-08 17:05:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-03-08 17:05:18,815 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 146 [2025-03-08 17:05:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:18,815 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-03-08 17:05:18,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-03-08 17:05:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:18,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:18,821 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:18,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:19,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:19,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash -960472911, now seen corresponding path program 1 times [2025-03-08 17:05:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:19,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184766749] [2025-03-08 17:05:19,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:19,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:19,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:19,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184766749] [2025-03-08 17:05:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184766749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:19,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:19,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577355849] [2025-03-08 17:05:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:19,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:19,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:19,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:19,391 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:19,511 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2025-03-08 17:05:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:05:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2025-03-08 17:05:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:19,513 INFO L225 Difference]: With dead ends: 241 [2025-03-08 17:05:19,513 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 17:05:19,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:19,513 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 111 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:19,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 222 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:05:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 17:05:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 17:05:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2025-03-08 17:05:19,521 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 148 [2025-03-08 17:05:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:19,521 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2025-03-08 17:05:19,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2025-03-08 17:05:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:19,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:19,522 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:19,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:05:19,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:19,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash -929453104, now seen corresponding path program 1 times [2025-03-08 17:05:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:19,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023249070] [2025-03-08 17:05:19,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:19,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:19,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:19,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:19,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023249070] [2025-03-08 17:05:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023249070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:19,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735526414] [2025-03-08 17:05:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:19,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:19,856 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:20,050 INFO L93 Difference]: Finished difference Result 286 states and 397 transitions. [2025-03-08 17:05:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:20,052 INFO L225 Difference]: With dead ends: 286 [2025-03-08 17:05:20,052 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 17:05:20,052 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-03-08 17:05:20,054 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:20,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 484 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:05:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 17:05:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 125. [2025-03-08 17:05:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.330188679245283) internal successors, (141), 106 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-03-08 17:05:20,065 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 148 [2025-03-08 17:05:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:20,066 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-03-08 17:05:20,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-03-08 17:05:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:20,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:20,068 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:20,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:05:20,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:20,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 393084684, now seen corresponding path program 1 times [2025-03-08 17:05:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411387585] [2025-03-08 17:05:20,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:20,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:20,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:20,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:20,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411387585] [2025-03-08 17:05:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411387585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483886464] [2025-03-08 17:05:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:20,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:20,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:20,215 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:20,537 INFO L93 Difference]: Finished difference Result 295 states and 409 transitions. [2025-03-08 17:05:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:20,539 INFO L225 Difference]: With dead ends: 295 [2025-03-08 17:05:20,539 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 17:05:20,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:05:20,540 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 51 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:20,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 462 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:05:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 17:05:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2025-03-08 17:05:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 123 states have internal predecessors, (164), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2025-03-08 17:05:20,548 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 148 [2025-03-08 17:05:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:20,549 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2025-03-08 17:05:20,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2025-03-08 17:05:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:20,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:20,550 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:20,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:05:20,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:20,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -117449493, now seen corresponding path program 1 times [2025-03-08 17:05:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215870882] [2025-03-08 17:05:20,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:20,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:20,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:20,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:20,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 17:05:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:05:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215870882] [2025-03-08 17:05:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215870882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:05:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439608506] [2025-03-08 17:05:20,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:20,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:20,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:20,766 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:20,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 17:05:20,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:21,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:21,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:21,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:21,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:21,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:21,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:21,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439608506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:21,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:05:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 17:05:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204096606] [2025-03-08 17:05:21,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:21,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:05:21,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:21,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:21,034 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:21,062 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-03-08 17:05:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:21,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:21,065 INFO L225 Difference]: With dead ends: 284 [2025-03-08 17:05:21,065 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 17:05:21,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:21,066 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 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-03-08 17:05:21,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 17:05:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-08 17:05:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.3253968253968254) internal successors, (167), 126 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2025-03-08 17:05:21,074 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 148 [2025-03-08 17:05:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:21,074 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2025-03-08 17:05:21,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2025-03-08 17:05:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:21,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:21,076 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:21,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 17:05:21,280 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash -424465527, now seen corresponding path program 1 times [2025-03-08 17:05:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:05:21,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926256057] [2025-03-08 17:05:21,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:05:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:21,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:21,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 17:05:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891947201] [2025-03-08 17:05:21,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:21,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:21,433 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:05:21,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 17:05:21,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:22,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:22,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:22,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:05:22,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:05:23,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:24,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:24,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:24,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:05:24,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:05:24,847 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:05:24,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 17:05:24,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:25,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:05:25,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:25,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:05:25,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:05:25 BoogieIcfgContainer [2025-03-08 17:05:25,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:05:25,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:05:25,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:05:25,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:05:25,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:13" (3/4) ... [2025-03-08 17:05:25,169 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 17:05:25,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:05:25,170 INFO L158 Benchmark]: Toolchain (without parser) took 12740.70ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 112.6MB in the beginning and 443.1MB in the end (delta: -330.4MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-08 17:05:25,170 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:25,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.67ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:05:25,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.06ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:25,171 INFO L158 Benchmark]: Boogie Preprocessor took 38.05ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:05:25,171 INFO L158 Benchmark]: IcfgBuilder took 615.69ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 55.1MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 17:05:25,172 INFO L158 Benchmark]: TraceAbstraction took 11768.03ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 54.2MB in the beginning and 443.2MB in the end (delta: -389.0MB). Peak memory consumption was 247.5MB. Max. memory is 16.1GB. [2025-03-08 17:05:25,172 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 520.1MB. Free memory was 443.2MB in the beginning and 443.1MB in the end (delta: 105.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:05:25,173 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.67ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.06ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.05ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 615.69ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 55.1MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11768.03ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 54.2MB in the beginning and 443.2MB in the end (delta: -389.0MB). Peak memory consumption was 247.5MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 520.1MB. Free memory was 443.2MB in the beginning and 443.1MB in the end (delta: 105.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L61] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L62] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L63] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L64] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L65] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L66] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L67] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L68] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L69] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L70] signed short int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L71] signed short int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L72] signed short int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L73] signed long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L74] unsigned long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L75] unsigned long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L76] float* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L77] signed long int* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L78] signed short int last_1_WrapperStruct00_var_1_13 = -25; [L79] signed long int last_1_WrapperStruct00_var_1_17 = 5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=0, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L150] isInitial = 1 [L151] FCALL initially() [L152] COND TRUE 1 [L153] CALL updateLastVariables() [L142] EXPR WrapperStruct00.var_1_13 [L142] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L143] EXPR WrapperStruct00.var_1_17 [L143] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L153] RET updateLastVariables() [L154] CALL updateVariables() [L113] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L114] EXPR WrapperStruct00.var_1_2 [L114] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_2 [L114] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_3 [L116] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_3 [L116] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L117] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L118] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L123] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L124] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L125] EXPR WrapperStruct00.var_1_11 [L125] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_11 [L125] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L125] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L126] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L127] EXPR WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L127] EXPR WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L127] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L127] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L127] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L128] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L129] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L131] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L132] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L134] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L135] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L136] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L137] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ulong() [L138] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L139] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L139] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L139] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L154] RET updateVariables() [L155] CALL step() [L83] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L83] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17; [L84] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_2=49] [L84] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L91] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L93] (*(WrapperStruct00_var_1_17_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L95] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L95] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L96] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L96] (*(WrapperStruct00_var_1_21_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L97] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_17_Pointer)); [L98] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_1=-10, stepLocal_2=49] [L98] COND FALSE !(stepLocal_1 != (*(WrapperStruct00_var_1_21_Pointer))) [L101] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L101] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L101] unsigned long int stepLocal_0 = (*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer)); [L102] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967298, stepLocal_2=49] [L102] COND FALSE !(((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L107] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967298, stepLocal_2=49] [L107] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L155] RET step() [L156] CALL, EXPR property() [L146] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) [L146] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1 [L146] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) [L146] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L146] EXPR (((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146-L147] return (((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer)))) ; [L156] RET, EXPR property() [L156] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 182 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 5011 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3370 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1641 mSDtfsCounter, 558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1239 GetRequests, 1178 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=11, InterpolantAutomatonStates: 47, 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, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 3671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5029 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10073/10336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 17:05:25,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:05:27,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:05:27,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 17:05:27,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:05:27,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:05:27,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:05:27,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:05:27,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:05:27,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:05:27,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:05:27,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:05:27,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:05:27,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:05:27,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:05:27,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:05:27,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:05:27,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:27,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:05:27,165 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a [2025-03-08 17:05:27,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:05:27,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:05:27,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:05:27,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:05:27,412 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:05:27,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i [2025-03-08 17:05:28,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3265a5e/320172491a8f4a628e49a8abb91716de/FLAGd17c80a86 [2025-03-08 17:05:28,804 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:05:28,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i [2025-03-08 17:05:28,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3265a5e/320172491a8f4a628e49a8abb91716de/FLAGd17c80a86 [2025-03-08 17:05:28,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3265a5e/320172491a8f4a628e49a8abb91716de [2025-03-08 17:05:28,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:05:28,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:05:28,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:28,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:05:28,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:05:28,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:28" (1/1) ... [2025-03-08 17:05:28,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411270d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:28, skipping insertion in model container [2025-03-08 17:05:28,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:05:28" (1/1) ... [2025-03-08 17:05:28,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:05:28,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i[917,930] [2025-03-08 17:05:29,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:29,054 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:05:29,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i[917,930] [2025-03-08 17:05:29,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:05:29,106 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:05:29,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29 WrapperNode [2025-03-08 17:05:29,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:05:29,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:29,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:05:29,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:05:29,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,168 INFO L138 Inliner]: procedures = 40, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-08 17:05:29,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:05:29,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:05:29,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:05:29,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:05:29,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,216 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-03-08 17:05:29,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:05:29,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:05:29,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:05:29,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:05:29,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (1/1) ... [2025-03-08 17:05:29,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:05:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:05:29,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:05:29,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 17:05:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:05:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:05:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 17:05:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 17:05:29,415 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:05:29,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:05:33,198 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite111#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite130#1;havoc property_#t~mem120#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-08 17:05:33,230 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-08 17:05:33,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:05:33,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:05:33,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:05:33,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:33 BoogieIcfgContainer [2025-03-08 17:05:33,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:05:33,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:05:33,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:05:33,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:05:33,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:05:28" (1/3) ... [2025-03-08 17:05:33,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b91522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:33, skipping insertion in model container [2025-03-08 17:05:33,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:05:29" (2/3) ... [2025-03-08 17:05:33,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b91522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:05:33, skipping insertion in model container [2025-03-08 17:05:33,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:05:33" (3/3) ... [2025-03-08 17:05:33,244 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-68.i [2025-03-08 17:05:33,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:05:33,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-68.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:05:33,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:05:33,311 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;@5b20b6c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:05:33,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:05:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:33,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:33,328 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:33,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1440182119, now seen corresponding path program 1 times [2025-03-08 17:05:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351595262] [2025-03-08 17:05:33,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:33,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:33,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 17:05:33,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:33,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:33,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:33,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:33,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:05:33,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-08 17:05:33,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:33,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351595262] [2025-03-08 17:05:33,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351595262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:33,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:05:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470766896] [2025-03-08 17:05:33,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:33,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:05:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:33,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:05:33,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:33,954 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:33,972 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2025-03-08 17:05:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:05:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-03-08 17:05:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:33,977 INFO L225 Difference]: With dead ends: 220 [2025-03-08 17:05:33,977 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 17:05:33,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:05:33,981 INFO L435 NwaCegarLoop]: 160 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, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:33,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 17:05:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 17:05:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-08 17:05:34,011 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2025-03-08 17:05:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:34,011 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-08 17:05:34,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-08 17:05:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:34,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:34,013 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:34,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 17:05:34,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:34,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:34,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash -285109452, now seen corresponding path program 1 times [2025-03-08 17:05:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934194003] [2025-03-08 17:05:34,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:34,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:34,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:34,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 17:05:34,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:34,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:34,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:34,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:34,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:34,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:34,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:34,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934194003] [2025-03-08 17:05:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934194003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080668418] [2025-03-08 17:05:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:34,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:34,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:34,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:34,763 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:34,833 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-03-08 17:05:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:34,837 INFO L225 Difference]: With dead ends: 220 [2025-03-08 17:05:34,837 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 17:05:34,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:34,838 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 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-03-08 17:05:34,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 17:05:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-08 17:05:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-03-08 17:05:34,849 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 146 [2025-03-08 17:05:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:34,850 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-03-08 17:05:34,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-03-08 17:05:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 17:05:34,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:34,851 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:34,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 17:05:35,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:35,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:35,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash 592216155, now seen corresponding path program 1 times [2025-03-08 17:05:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:35,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144835234] [2025-03-08 17:05:35,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:35,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:35,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:35,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 17:05:35,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 17:05:35,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 17:05:35,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:35,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:35,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:35,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:35,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:35,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144835234] [2025-03-08 17:05:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144835234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:35,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:35,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749410613] [2025-03-08 17:05:35,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:35,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:35,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:35,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:35,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:35,546 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:35,596 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2025-03-08 17:05:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 17:05:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:35,601 INFO L225 Difference]: With dead ends: 226 [2025-03-08 17:05:35,601 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 17:05:35,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:35,602 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 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-03-08 17:05:35,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 17:05:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2025-03-08 17:05:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-08 17:05:35,613 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2025-03-08 17:05:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:35,613 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-08 17:05:35,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-08 17:05:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:35,618 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:35,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 17:05:35,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:35,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 78260086, now seen corresponding path program 1 times [2025-03-08 17:05:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427615789] [2025-03-08 17:05:35,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:35,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 17:05:35,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:36,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:36,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:36,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:36,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:05:36,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:36,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:36,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427615789] [2025-03-08 17:05:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427615789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:36,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549977922] [2025-03-08 17:05:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:36,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:05:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:36,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:05:36,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:36,322 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:36,388 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2025-03-08 17:05:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:05:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:36,391 INFO L225 Difference]: With dead ends: 230 [2025-03-08 17:05:36,391 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 17:05:36,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:05:36,392 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:36,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:05:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 17:05:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-08 17:05:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-08 17:05:36,405 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2025-03-08 17:05:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:36,408 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-08 17:05:36,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-08 17:05:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:36,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:36,409 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:36,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 17:05:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:36,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1718691273, now seen corresponding path program 1 times [2025-03-08 17:05:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:36,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486586837] [2025-03-08 17:05:36,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:36,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:36,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 17:05:36,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:37,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:37,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:37,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 17:05:37,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:37,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:37,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486586837] [2025-03-08 17:05:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486586837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:05:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210381952] [2025-03-08 17:05:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:37,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:37,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:37,089 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:37,150 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-08 17:05:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:05:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:37,153 INFO L225 Difference]: With dead ends: 236 [2025-03-08 17:05:37,153 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 17:05:37,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:37,153 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:37,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 745 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:05:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 17:05:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-08 17:05:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-03-08 17:05:37,165 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2025-03-08 17:05:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-03-08 17:05:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-03-08 17:05:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:37,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:37,166 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:37,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 17:05:37,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:37,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash 768821560, now seen corresponding path program 1 times [2025-03-08 17:05:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271136789] [2025-03-08 17:05:37,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:37,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:37,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:37,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 17:05:37,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:37,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:37,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:37,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:37,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:05:37,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:37,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:37,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271136789] [2025-03-08 17:05:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271136789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:05:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582017117] [2025-03-08 17:05:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:05:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:37,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:05:37,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:05:37,878 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:38,066 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2025-03-08 17:05:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:38,068 INFO L225 Difference]: With dead ends: 240 [2025-03-08 17:05:38,068 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 17:05:38,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:05:38,070 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:38,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:05:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 17:05:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-08 17:05:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-03-08 17:05:38,078 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2025-03-08 17:05:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:38,078 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-03-08 17:05:38,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-03-08 17:05:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:38,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:38,080 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:38,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 17:05:38,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:38,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:38,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1656325241, now seen corresponding path program 1 times [2025-03-08 17:05:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:38,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091253335] [2025-03-08 17:05:38,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:38,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:38,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:38,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 17:05:38,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:38,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:38,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:38,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:38,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 17:05:38,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:38,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:38,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091253335] [2025-03-08 17:05:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091253335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:38,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:38,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:05:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485052980] [2025-03-08 17:05:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:38,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:05:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:38,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:05:38,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:38,753 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:38,919 INFO L93 Difference]: Finished difference Result 244 states and 345 transitions. [2025-03-08 17:05:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:05:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:38,921 INFO L225 Difference]: With dead ends: 244 [2025-03-08 17:05:38,921 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 17:05:38,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:05:38,922 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:38,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1021 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:05:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 17:05:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-08 17:05:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2025-03-08 17:05:38,927 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 148 [2025-03-08 17:05:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:38,927 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2025-03-08 17:05:38,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2025-03-08 17:05:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 17:05:38,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:38,928 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:38,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:39,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:39,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:39,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:39,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1657248762, now seen corresponding path program 1 times [2025-03-08 17:05:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606645089] [2025-03-08 17:05:39,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:39,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:39,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:39,133 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:39,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-08 17:05:39,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 17:05:39,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 17:05:39,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:39,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:39,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:05:39,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:39,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-08 17:05:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:39,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:39,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606645089] [2025-03-08 17:05:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606645089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:39,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:39,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:39,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471177553] [2025-03-08 17:05:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:39,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:39,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:39,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:39,654 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:40,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 17:05:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:43,348 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2025-03-08 17:05:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:43,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-08 17:05:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:43,350 INFO L225 Difference]: With dead ends: 246 [2025-03-08 17:05:43,350 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 17:05:43,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:43,351 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 154 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:43,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 453 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 17:05:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 17:05:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-08 17:05:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-03-08 17:05:43,355 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 148 [2025-03-08 17:05:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:43,356 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-03-08 17:05:43,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:05:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-03-08 17:05:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 17:05:43,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:43,357 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:43,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-08 17:05:43,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:43,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -444222056, now seen corresponding path program 1 times [2025-03-08 17:05:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715334469] [2025-03-08 17:05:43,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:43,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:43,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:43,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:43,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 17:05:43,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 17:05:43,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 17:05:43,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:43,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:43,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:05:43,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:44,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-08 17:05:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:05:44,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:44,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:44,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715334469] [2025-03-08 17:05:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715334469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129220349] [2025-03-08 17:05:44,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:44,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:44,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:44,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:44,087 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:45,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 17:05:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:47,558 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2025-03-08 17:05:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 17:05:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:47,559 INFO L225 Difference]: With dead ends: 246 [2025-03-08 17:05:47,559 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 17:05:47,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:47,560 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 143 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:47,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 448 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 17:05:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 17:05:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-08 17:05:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2025-03-08 17:05:47,570 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 150 [2025-03-08 17:05:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:47,571 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2025-03-08 17:05:47,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2025-03-08 17:05:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 17:05:47,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:47,572 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:47,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:47,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:47,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:47,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 182919290, now seen corresponding path program 1 times [2025-03-08 17:05:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:47,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641304567] [2025-03-08 17:05:47,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:47,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:47,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:47,776 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:47,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-08 17:05:47,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 17:05:48,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 17:05:48,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:48,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:48,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:05:48,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:48,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:05:48,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-08 17:05:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 17:05:48,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:48,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:48,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641304567] [2025-03-08 17:05:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641304567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:48,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954290400] [2025-03-08 17:05:48,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:48,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:48,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:48,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:48,420 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:49,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 17:05:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:51,806 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2025-03-08 17:05:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-03-08 17:05:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:51,808 INFO L225 Difference]: With dead ends: 246 [2025-03-08 17:05:51,808 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 17:05:51,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:51,809 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:51,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 17:05:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 17:05:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-08 17:05:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2025-03-08 17:05:51,813 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 152 [2025-03-08 17:05:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2025-03-08 17:05:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2025-03-08 17:05:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 17:05:51,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:51,814 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:51,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-08 17:05:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:52,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1378520168, now seen corresponding path program 1 times [2025-03-08 17:05:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712555402] [2025-03-08 17:05:52,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:52,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:52,020 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:52,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-08 17:05:52,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 17:05:52,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 17:05:52,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:52,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:52,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:05:52,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:52,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:05:52,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-08 17:05:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-08 17:05:52,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:52,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712555402] [2025-03-08 17:05:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712555402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:05:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463409121] [2025-03-08 17:05:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:52,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:52,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:52,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:52,683 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:54,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 17:05:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:05:56,469 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2025-03-08 17:05:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:05:56,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-03-08 17:05:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:05:56,471 INFO L225 Difference]: With dead ends: 246 [2025-03-08 17:05:56,471 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 17:05:56,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:05:56,471 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 17:05:56,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 441 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 17:05:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 17:05:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-08 17:05:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:05:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2025-03-08 17:05:56,476 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 154 [2025-03-08 17:05:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:05:56,476 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2025-03-08 17:05:56,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 17:05:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2025-03-08 17:05:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:05:56,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:05:56,479 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:05:56,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-03-08 17:05:56,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:56,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:05:56,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:05:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1113733242, now seen corresponding path program 1 times [2025-03-08 17:05:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:05:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510970470] [2025-03-08 17:05:56,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:05:56,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:05:56,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:05:56,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:05:56,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-08 17:05:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:05:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:05:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:05:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:05:57,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:05:57,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:05:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:05:58,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:05:58,016 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:05:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510970470] [2025-03-08 17:05:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510970470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:05:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:05:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:05:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375957219] [2025-03-08 17:05:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:05:58,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:05:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:05:58,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:05:58,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:05:58,017 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:06:00,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 17:06:03,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:06:08,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:06:11,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:06:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:15,278 INFO L93 Difference]: Finished difference Result 293 states and 398 transitions. [2025-03-08 17:06:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:06:15,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-08 17:06:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:15,283 INFO L225 Difference]: With dead ends: 293 [2025-03-08 17:06:15,283 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 17:06:15,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:06:15,284 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:15,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 383 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2025-03-08 17:06:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 17:06:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2025-03-08 17:06:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 108 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:06:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-08 17:06:15,288 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 156 [2025-03-08 17:06:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:15,288 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-08 17:06:15,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:06:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-08 17:06:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:06:15,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:15,289 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:15,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2025-03-08 17:06:15,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:06:15,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:15,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash 634965142, now seen corresponding path program 1 times [2025-03-08 17:06:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:06:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404340081] [2025-03-08 17:06:15,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:06:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:06:15,494 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:06:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-08 17:06:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:06:16,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:06:16,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:16,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:16,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 17:06:16,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:06:43,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 17:06:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:06:43,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:06:43,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:06:43,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404340081] [2025-03-08 17:06:43,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404340081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:43,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:43,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:06:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685198972] [2025-03-08 17:06:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:43,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:06:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:06:43,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:06:43,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:06:43,493 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:06:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:06:45,821 INFO L93 Difference]: Finished difference Result 251 states and 345 transitions. [2025-03-08 17:06:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:06:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-08 17:06:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:06:45,822 INFO L225 Difference]: With dead ends: 251 [2025-03-08 17:06:45,822 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 17:06:45,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:06:45,823 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 74 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:06:45,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 272 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 17:06:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 17:06:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 17:06:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 17:06:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2025-03-08 17:06:45,829 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 156 [2025-03-08 17:06:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:06:45,829 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2025-03-08 17:06:45,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 17:06:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2025-03-08 17:06:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 17:06:45,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:06:45,831 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:06:45,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-08 17:06:46,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:06:46,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:06:46,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:06:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash 665984949, now seen corresponding path program 1 times [2025-03-08 17:06:46,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:06:46,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865040614] [2025-03-08 17:06:46,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:06:46,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 17:06:46,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:06:46,035 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 17:06:46,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-08 17:06:46,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 17:06:46,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 17:06:46,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:06:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:06:46,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:06:46,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:06:47,519 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 17:06:47,520 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 26 treesize of output 10 [2025-03-08 17:06:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 17:06:47,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:06:47,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:06:47,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865040614] [2025-03-08 17:06:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865040614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:06:47,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:06:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:06:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485240601] [2025-03-08 17:06:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:06:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:06:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:06:47,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:06:47,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:06:47,776 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)