./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.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 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:47:37,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:47:37,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:47:37,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:47:37,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:47:37,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:47:37,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:47:37,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:47:37,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:47:37,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:47:37,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:47:37,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:47:37,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:47:37,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:47:37,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:37,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:47:37,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:47:37,781 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 -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2025-03-04 01:47:37,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:47:37,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:47:38,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:47:38,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:47:38,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:47:38,004 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-17.i [2025-03-04 01:47:39,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253fcdf93/da1f2ab6b3504ac78c5377263ca18f11/FLAG0e77eecfd [2025-03-04 01:47:39,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:47:39,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2025-03-04 01:47:39,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253fcdf93/da1f2ab6b3504ac78c5377263ca18f11/FLAG0e77eecfd [2025-03-04 01:47:39,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253fcdf93/da1f2ab6b3504ac78c5377263ca18f11 [2025-03-04 01:47:39,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:47:39,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:47:39,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:39,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:47:39,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:47:39,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:39,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721f17ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39, skipping insertion in model container [2025-03-04 01:47:39,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:39,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:47:39,820 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-17.i[917,930] [2025-03-04 01:47:39,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:39,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:47:39,893 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-17.i[917,930] [2025-03-04 01:47:39,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:39,958 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:47:39,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39 WrapperNode [2025-03-04 01:47:39,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:39,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:39,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:47:39,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:47:39,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:39,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,016 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 631 [2025-03-04 01:47:40,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:40,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:47:40,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:47:40,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:47:40,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,039 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:47:40,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:47:40,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:47:40,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:47:40,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:47:40,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (1/1) ... [2025-03-04 01:47:40,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:40,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:47:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:47:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:47:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:47:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:47:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:47:40,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:47:40,246 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:47:40,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:47:40,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2025-03-04 01:47:40,741 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2025-03-04 01:47:40,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:47:40,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:47:40,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:47:40,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:40 BoogieIcfgContainer [2025-03-04 01:47:40,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:47:40,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:47:40,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:47:40,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:47:40,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:47:39" (1/3) ... [2025-03-04 01:47:40,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4606d606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:40, skipping insertion in model container [2025-03-04 01:47:40,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:39" (2/3) ... [2025-03-04 01:47:40,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4606d606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:40, skipping insertion in model container [2025-03-04 01:47:40,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:40" (3/3) ... [2025-03-04 01:47:40,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2025-03-04 01:47:40,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:47:40,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-17.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:47:40,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:47:40,829 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;@342014e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:47:40,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:47:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:47:40,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:40,844 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:40,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 295797638, now seen corresponding path program 1 times [2025-03-04 01:47:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428262164] [2025-03-04 01:47:40,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:47:41,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:47:41,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:41,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:47:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428262164] [2025-03-04 01:47:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428262164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565930747] [2025-03-04 01:47:41,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:41,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:47:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:47:41,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:47:41,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:47:41,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:41,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:41,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:47:41,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:47:41,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565930747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:47:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:47:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408732403] [2025-03-04 01:47:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:47:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:41,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:47:41,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:41,453 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:47:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:41,479 INFO L93 Difference]: Finished difference Result 280 states and 435 transitions. [2025-03-04 01:47:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:47:41,480 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-04 01:47:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:41,484 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:47:41,484 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:47:41,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:41,490 INFO L435 NwaCegarLoop]: 207 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, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:41,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:47:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-04 01:47:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-03-04 01:47:41,528 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2025-03-04 01:47:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:41,528 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-03-04 01:47:41,528 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:47:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-03-04 01:47:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:47:41,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:41,530 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:41,537 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-04 01:47:41,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:47:41,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:41,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1703735960, now seen corresponding path program 1 times [2025-03-04 01:47:41,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:41,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98649563] [2025-03-04 01:47:41,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:41,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:41,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:47:41,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:47:41,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:41,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:47:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98649563] [2025-03-04 01:47:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98649563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:42,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077899412] [2025-03-04 01:47:42,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:42,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:42,165 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-04 01:47:42,166 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-04 01:47:42,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:47:42,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:47:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:42,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:47:42,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:42,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077899412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:42,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:47:42,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:47:42,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730571438] [2025-03-04 01:47:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:47:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:42,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:47:42,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:47:42,436 INFO L87 Difference]: Start difference. First operand 140 states and 207 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:42,483 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2025-03-04 01:47:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:47:42,484 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-03-04 01:47:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:42,485 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:47:42,485 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 01:47:42,486 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-04 01:47:42,486 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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-04 01:47:42,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 01:47:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2025-03-04 01:47:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2025-03-04 01:47:42,497 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2025-03-04 01:47:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:42,498 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2025-03-04 01:47:42,498 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2025-03-04 01:47:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:47:42,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:42,500 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:42,507 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-04 01:47:42,700 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-04 01:47:42,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:42,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 783776873, now seen corresponding path program 1 times [2025-03-04 01:47:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526064217] [2025-03-04 01:47:42,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:42,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:47:42,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:47:42,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:47:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526064217] [2025-03-04 01:47:42,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526064217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948676971] [2025-03-04 01:47:42,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:42,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:42,922 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-04 01:47:42,924 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-04 01:47:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:47:43,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:47:43,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:43,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:43,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:47:43,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:43,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948676971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:47:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:47:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798961567] [2025-03-04 01:47:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:47:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:47:43,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:43,165 INFO L87 Difference]: Start difference. First operand 142 states and 209 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:43,192 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2025-03-04 01:47:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:47:43,196 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-03-04 01:47:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:43,197 INFO L225 Difference]: With dead ends: 283 [2025-03-04 01:47:43,197 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 01:47:43,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:43,198 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:43,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 01:47:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 01:47:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-03-04 01:47:43,210 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2025-03-04 01:47:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:43,211 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-03-04 01:47:43,211 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-03-04 01:47:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:47:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:43,214 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:43,224 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-04 01:47:43,414 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-04 01:47:43,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1835039897, now seen corresponding path program 1 times [2025-03-04 01:47:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:43,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558557747] [2025-03-04 01:47:43,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:43,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:47:43,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:47:43,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:43,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558557747] [2025-03-04 01:47:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558557747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:47:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301649567] [2025-03-04 01:47:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:47:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:44,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:47:44,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:44,025 INFO L87 Difference]: Start difference. First operand 144 states and 211 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:44,344 INFO L93 Difference]: Finished difference Result 347 states and 509 transitions. [2025-03-04 01:47:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:47:44,344 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:47:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:44,346 INFO L225 Difference]: With dead ends: 347 [2025-03-04 01:47:44,346 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 01:47:44,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:47:44,347 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 234 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:44,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 756 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 01:47:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 152. [2025-03-04 01:47:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 223 transitions. [2025-03-04 01:47:44,361 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 223 transitions. Word has length 143 [2025-03-04 01:47:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 223 transitions. [2025-03-04 01:47:44,362 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 223 transitions. [2025-03-04 01:47:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:47:44,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:44,363 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:44,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:47:44,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1424857434, now seen corresponding path program 1 times [2025-03-04 01:47:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479778547] [2025-03-04 01:47:44,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:44,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:47:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:47:44,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:44,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:45,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479778547] [2025-03-04 01:47:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479778547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:47:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113800414] [2025-03-04 01:47:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:45,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:47:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:45,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:47:45,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:45,028 INFO L87 Difference]: Start difference. First operand 152 states and 223 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:45,274 INFO L93 Difference]: Finished difference Result 368 states and 540 transitions. [2025-03-04 01:47:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:47:45,274 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:47:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:45,276 INFO L225 Difference]: With dead ends: 368 [2025-03-04 01:47:45,276 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 01:47:45,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:45,277 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 409 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:45,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 670 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 01:47:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 174. [2025-03-04 01:47:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 156 states have (on average 1.4230769230769231) internal successors, (222), 156 states have internal predecessors, (222), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 254 transitions. [2025-03-04 01:47:45,291 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 254 transitions. Word has length 143 [2025-03-04 01:47:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:45,291 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 254 transitions. [2025-03-04 01:47:45,291 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 254 transitions. [2025-03-04 01:47:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:47:45,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:45,292 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:45,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:47:45,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:45,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1062655399, now seen corresponding path program 1 times [2025-03-04 01:47:45,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942139323] [2025-03-04 01:47:45,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:45,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:47:45,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:47:45,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:45,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:47,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942139323] [2025-03-04 01:47:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942139323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:47:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311465743] [2025-03-04 01:47:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:47,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:47:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:47:47,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:47:47,012 INFO L87 Difference]: Start difference. First operand 174 states and 254 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:47:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:47,507 INFO L93 Difference]: Finished difference Result 545 states and 794 transitions. [2025-03-04 01:47:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 143 [2025-03-04 01:47:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:47,510 INFO L225 Difference]: With dead ends: 545 [2025-03-04 01:47:47,510 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 01:47:47,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:47:47,513 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 463 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:47,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1030 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:47:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 01:47:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 303. [2025-03-04 01:47:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 268 states have internal predecessors, (377), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:47:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 441 transitions. [2025-03-04 01:47:47,545 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 441 transitions. Word has length 143 [2025-03-04 01:47:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:47,545 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 441 transitions. [2025-03-04 01:47:47,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:47:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 441 transitions. [2025-03-04 01:47:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:47:47,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:47,547 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:47,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:47:47,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1110289980, now seen corresponding path program 1 times [2025-03-04 01:47:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093746557] [2025-03-04 01:47:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:47,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:47:47,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:47:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093746557] [2025-03-04 01:47:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093746557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:47:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167659724] [2025-03-04 01:47:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:48,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:47:48,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:48,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:47:48,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:47:48,106 INFO L87 Difference]: Start difference. First operand 303 states and 441 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:48,533 INFO L93 Difference]: Finished difference Result 530 states and 772 transitions. [2025-03-04 01:47:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:47:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2025-03-04 01:47:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:48,535 INFO L225 Difference]: With dead ends: 530 [2025-03-04 01:47:48,535 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 01:47:48,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:47:48,536 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 231 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:48,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 795 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:47:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 01:47:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 293. [2025-03-04 01:47:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 258 states have (on average 1.4031007751937985) internal successors, (362), 258 states have internal predecessors, (362), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:47:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 426 transitions. [2025-03-04 01:47:48,567 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 426 transitions. Word has length 144 [2025-03-04 01:47:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:48,568 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 426 transitions. [2025-03-04 01:47:48,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:47:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 426 transitions. [2025-03-04 01:47:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:47:48,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:48,573 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:47:48,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:48,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -697164483, now seen corresponding path program 1 times [2025-03-04 01:47:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:48,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429860450] [2025-03-04 01:47:48,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:48,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:47:48,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:47:48,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:47:49,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429860450] [2025-03-04 01:47:49,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429860450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:47:49,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428372702] [2025-03-04 01:47:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:47:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:49,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:47:49,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:49,089 INFO L87 Difference]: Start difference. First operand 293 states and 426 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:47:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:49,371 INFO L93 Difference]: Finished difference Result 578 states and 836 transitions. [2025-03-04 01:47:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:49,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2025-03-04 01:47:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:49,374 INFO L225 Difference]: With dead ends: 578 [2025-03-04 01:47:49,374 INFO L226 Difference]: Without dead ends: 417 [2025-03-04 01:47:49,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:47:49,375 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 305 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:49,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 829 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-04 01:47:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 188. [2025-03-04 01:47:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:47:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 270 transitions. [2025-03-04 01:47:49,385 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 270 transitions. Word has length 144 [2025-03-04 01:47:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:49,386 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 270 transitions. [2025-03-04 01:47:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:47:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 270 transitions. [2025-03-04 01:47:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:47:49,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:49,387 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:49,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:47:49,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:49,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 298270044, now seen corresponding path program 1 times [2025-03-04 01:47:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609176172] [2025-03-04 01:47:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:49,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:47:49,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:47:49,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:47:49,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:47:49,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:47:49,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:47:49,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:49,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:47:49,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:47:49,603 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:47:49,604 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:47:49,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:47:49,607 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:49,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:47:49,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:47:49 BoogieIcfgContainer [2025-03-04 01:47:49,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:47:49,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:47:49,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:47:49,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:47:49,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:40" (3/4) ... [2025-03-04 01:47:49,732 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:47:49,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:47:49,733 INFO L158 Benchmark]: Toolchain (without parser) took 10037.92ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 133.2MB in the beginning and 284.3MB in the end (delta: -151.1MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. [2025-03-04 01:47:49,733 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:47:49,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.16ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 116.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:47:49,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:47:49,734 INFO L158 Benchmark]: Boogie Preprocessor took 61.76ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:47:49,734 INFO L158 Benchmark]: IcfgBuilder took 675.70ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 69.4MB in the end (delta: 39.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:47:49,735 INFO L158 Benchmark]: TraceAbstraction took 8972.60ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 68.6MB in the beginning and 284.5MB in the end (delta: -216.0MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. [2025-03-04 01:47:49,735 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 545.3MB. Free memory was 284.5MB in the beginning and 284.3MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:47:49,736 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.72ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.16ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 116.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 112.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.76ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 675.70ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 69.4MB in the end (delta: 39.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8972.60ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 68.6MB in the beginning and 284.5MB in the end (delta: -216.0MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 545.3MB. Free memory was 284.5MB in the beginning and 284.3MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] double* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] signed short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L65] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L66] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L67] signed short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L68] signed short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L69] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L70] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L71] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L72] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L73] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L74] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L75] unsigned char last_1_WrapperStruct00_var_1_15 = 16; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=0, last_1_WrapperStruct00_var_1_15=16] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] CALL updateLastVariables() [L137] EXPR WrapperStruct00.var_1_15 [L137] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L147] RET updateLastVariables() [L148] CALL updateVariables() [L108] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L119] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L121] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L127] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L130] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L133] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L148] RET updateVariables() [L149] CALL step() [L79] (*(WrapperStruct00_var_1_12_Pointer)) = last_1_WrapperStruct00_var_1_15 [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_12_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L81] signed short int stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_0=6, stepLocal_1=16] [L82] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_10_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L89] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L92] COND FALSE !((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L95] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L100] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L100] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L103] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L103] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) [L140] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) [L140] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140-L141] return (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1643 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1643 mSDsluCounter, 5492 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3976 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 1516 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=6, InterpolantAutomatonStates: 42, 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, 8 MinimizatonAttempts, 466 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1707 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1552 ConstructedInterpolants, 0 QuantifiedInterpolants, 5551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1707 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 5160/5280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:47:49,754 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-17.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 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:47:51,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:47:51,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:47:51,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:47:51,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:47:51,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:47:51,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:47:51,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:47:51,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:47:51,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:47:51,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:47:51,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:47:51,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:47:51,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:47:51,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:47:51,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:47:51,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:51,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:47:51,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:47:51,782 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 -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2025-03-04 01:47:52,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:47:52,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:47:52,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:47:52,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:47:52,031 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:47:52,032 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-17.i [2025-03-04 01:47:53,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acbcbb0b/17baac3c9d11442cbc510158c6c4e525/FLAG81f7de448 [2025-03-04 01:47:53,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:47:53,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2025-03-04 01:47:53,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acbcbb0b/17baac3c9d11442cbc510158c6c4e525/FLAG81f7de448 [2025-03-04 01:47:53,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acbcbb0b/17baac3c9d11442cbc510158c6c4e525 [2025-03-04 01:47:53,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:47:53,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:47:53,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:53,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:47:53,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:47:53,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22061ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53, skipping insertion in model container [2025-03-04 01:47:53,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:47:53,637 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-17.i[917,930] [2025-03-04 01:47:53,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:53,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:47:53,714 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-17.i[917,930] [2025-03-04 01:47:53,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:53,778 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:47:53,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53 WrapperNode [2025-03-04 01:47:53,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:53,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:53,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:47:53,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:47:53,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,826 INFO L138 Inliner]: procedures = 40, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 628 [2025-03-04 01:47:53,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:53,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:47:53,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:47:53,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:47:53,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,873 INFO L175 MemorySlicer]: Split 157 memory accesses to 2 slices as follows [2, 155]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2025-03-04 01:47:53,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:47:53,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:47:53,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:47:53,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:47:53,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (1/1) ... [2025-03-04 01:47:53,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:53,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:47:53,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:47:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:47:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:47:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:47:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:47:53,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:47:53,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:47:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:47:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:47:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:47:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:47:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:47:53,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:47:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:47:53,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:47:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:47:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:47:54,098 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:47:54,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:48:01,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2025-03-04 01:48:01,301 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-03-04 01:48:01,301 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:48:01,312 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:48:01,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:48:01,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:01 BoogieIcfgContainer [2025-03-04 01:48:01,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:48:01,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:48:01,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:48:01,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:48:01,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:47:53" (1/3) ... [2025-03-04 01:48:01,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1befe7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:01, skipping insertion in model container [2025-03-04 01:48:01,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:53" (2/3) ... [2025-03-04 01:48:01,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1befe7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:01, skipping insertion in model container [2025-03-04 01:48:01,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:01" (3/3) ... [2025-03-04 01:48:01,321 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2025-03-04 01:48:01,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:48:01,334 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-17.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:48:01,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:48:01,393 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;@941eabd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:48:01,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:48:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:48:01,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:01,409 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:01,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1923271178, now seen corresponding path program 1 times [2025-03-04 01:48:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673376811] [2025-03-04 01:48:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:01,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:01,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:01,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:48:01,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:48:01,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:48:01,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:01,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:01,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:48:01,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-04 01:48:01,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:01,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673376811] [2025-03-04 01:48:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673376811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:48:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700089869] [2025-03-04 01:48:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:01,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:48:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:01,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:48:01,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:48:01,953 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:01,977 INFO L93 Difference]: Finished difference Result 280 states and 435 transitions. [2025-03-04 01:48:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:48:01,979 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-04 01:48:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:01,983 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:48:01,983 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:48:01,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:48:01,988 INFO L435 NwaCegarLoop]: 207 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, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:01,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:48:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-04 01:48:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-03-04 01:48:02,031 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2025-03-04 01:48:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:02,031 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-03-04 01:48:02,032 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-03-04 01:48:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:48:02,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:02,036 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:02,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:48:02,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:02,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:02,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash -76262420, now seen corresponding path program 1 times [2025-03-04 01:48:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156077963] [2025-03-04 01:48:02,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:02,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:02,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:02,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:02,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:48:02,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:48:02,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:48:02,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:02,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:02,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:48:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:48:02,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:02,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:02,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156077963] [2025-03-04 01:48:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156077963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:02,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:48:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033870132] [2025-03-04 01:48:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:02,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:48:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:02,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:48:02,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:02,778 INFO L87 Difference]: Start difference. First operand 140 states and 207 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:48:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:02,946 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2025-03-04 01:48:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:48:02,949 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-03-04 01:48:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:02,951 INFO L225 Difference]: With dead ends: 279 [2025-03-04 01:48:02,953 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:48:02,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:02,954 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:02,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:48:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:48:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-04 01:48:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2025-03-04 01:48:02,963 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2025-03-04 01:48:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:02,964 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2025-03-04 01:48:02,964 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:48:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2025-03-04 01:48:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:48:02,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:02,966 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:02,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:48:03,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:03,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 606390890, now seen corresponding path program 1 times [2025-03-04 01:48:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298282438] [2025-03-04 01:48:03,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:03,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:03,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:03,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:48:03,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:48:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:48:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:03,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:48:03,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:48:03,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:03,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298282438] [2025-03-04 01:48:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298282438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:48:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995594154] [2025-03-04 01:48:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:03,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:48:03,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:03,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:48:03,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:03,789 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:48:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:03,830 INFO L93 Difference]: Finished difference Result 284 states and 419 transitions. [2025-03-04 01:48:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:48:03,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:48:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:03,832 INFO L225 Difference]: With dead ends: 284 [2025-03-04 01:48:03,832 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:48:03,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:03,833 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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-04 01:48:03,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:48:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-03-04 01:48:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-03-04 01:48:03,842 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 143 [2025-03-04 01:48:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:03,843 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-03-04 01:48:03,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:48:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-03-04 01:48:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:48:03,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:03,844 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:03,865 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-04 01:48:04,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:04,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:04,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1201063573, now seen corresponding path program 1 times [2025-03-04 01:48:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079178283] [2025-03-04 01:48:04,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:04,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:04,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:48:04,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:48:04,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:48:04,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:04,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:04,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:48:04,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:04,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:48:04,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:48:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-04 01:48:04,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:04,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079178283] [2025-03-04 01:48:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079178283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:04,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:04,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25659176] [2025-03-04 01:48:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:48:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:04,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:48:04,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:04,870 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:08,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:48:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:13,197 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2025-03-04 01:48:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:48:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-04 01:48:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:13,200 INFO L225 Difference]: With dead ends: 286 [2025-03-04 01:48:13,200 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:48:13,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:13,201 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 174 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 504 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2025-03-04 01:48:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:48:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-03-04 01:48:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2025-03-04 01:48:13,213 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 143 [2025-03-04 01:48:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2025-03-04 01:48:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2025-03-04 01:48:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:48:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:13,214 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:13,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:48:13,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:13,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1579197513, now seen corresponding path program 1 times [2025-03-04 01:48:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095365382] [2025-03-04 01:48:13,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:13,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:13,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:13,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:13,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:48:13,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:48:13,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:48:13,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:13,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:48:14,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:14,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:48:14,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:48:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-04 01:48:14,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:14,190 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:14,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095365382] [2025-03-04 01:48:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095365382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363332934] [2025-03-04 01:48:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:14,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:48:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:14,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:48:14,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:14,192 INFO L87 Difference]: Start difference. First operand 144 states and 210 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:18,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:48:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:22,638 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2025-03-04 01:48:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:48:22,640 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-04 01:48:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:22,641 INFO L225 Difference]: With dead ends: 286 [2025-03-04 01:48:22,641 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:48:22,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:22,642 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 166 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:22,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-03-04 01:48:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:48:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-03-04 01:48:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2025-03-04 01:48:22,651 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 145 [2025-03-04 01:48:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:22,651 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2025-03-04 01:48:22,651 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2025-03-04 01:48:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:48:22,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:22,652 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:22,675 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-04 01:48:22,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:22,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:22,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1097433580, now seen corresponding path program 1 times [2025-03-04 01:48:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816904661] [2025-03-04 01:48:22,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:22,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:22,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:48:22,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:48:23,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:48:23,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:23,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:23,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:48:23,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-04 01:48:23,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:23,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816904661] [2025-03-04 01:48:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816904661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:23,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:23,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:48:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639486132] [2025-03-04 01:48:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:23,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:48:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:23,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:48:23,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:23,425 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:48:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:23,584 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2025-03-04 01:48:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:48:23,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-03-04 01:48:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:23,588 INFO L225 Difference]: With dead ends: 289 [2025-03-04 01:48:23,588 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 01:48:23,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:48:23,589 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:23,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 886 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 01:48:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2025-03-04 01:48:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2025-03-04 01:48:23,594 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 147 [2025-03-04 01:48:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:23,595 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2025-03-04 01:48:23,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:48:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2025-03-04 01:48:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:48:23,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:23,596 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:23,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:48:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:23,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1482800363, now seen corresponding path program 1 times [2025-03-04 01:48:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772824368] [2025-03-04 01:48:23,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:23,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:23,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:23,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:48:23,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:48:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:48:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:24,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:24,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:48:24,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:24,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:48:24,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:48:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-04 01:48:24,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:24,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772824368] [2025-03-04 01:48:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772824368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159852622] [2025-03-04 01:48:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:48:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:24,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:48:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:24,680 INFO L87 Difference]: Start difference. First operand 144 states and 208 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:28,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:48:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:32,761 INFO L93 Difference]: Finished difference Result 286 states and 414 transitions. [2025-03-04 01:48:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:48:32,761 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-03-04 01:48:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:32,762 INFO L225 Difference]: With dead ends: 286 [2025-03-04 01:48:32,763 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:48:32,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:32,764 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:32,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 490 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2025-03-04 01:48:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:48:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-03-04 01:48:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:48:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2025-03-04 01:48:32,771 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 147 [2025-03-04 01:48:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:32,771 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2025-03-04 01:48:32,771 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:48:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2025-03-04 01:48:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:48:32,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:32,772 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:32,791 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-04 01:48:32,973 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-04 01:48:32,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:32,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1318101687, now seen corresponding path program 1 times [2025-03-04 01:48:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30290509] [2025-03-04 01:48:32,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:32,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:32,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:32,976 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-04 01:48:32,976 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-04 01:48:33,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:48:33,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:48:33,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:33,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 01:48:33,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:34,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:48:34,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 01:48:38,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2025-03-04 01:48:38,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2025-03-04 01:48:46,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2025-03-04 01:48:47,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2025-03-04 01:49:00,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2025-03-04 01:49:00,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2025-03-04 01:49:01,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 98 [2025-03-04 01:49:02,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 55 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 109 [2025-03-04 01:49:07,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 120 [2025-03-04 01:49:08,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 123 [2025-03-04 01:49:09,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:49:09,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 104 treesize of output 122 [2025-03-04 01:49:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 307 proven. 148 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 01:49:09,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:49:10,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30290509] [2025-03-04 01:49:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30290509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [137551522] [2025-03-04 01:49:10,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:49:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:49:10,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:49:10,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:49:10,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.