./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.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 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:09:07,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:09:07,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:09:07,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:09:07,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:09:07,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:09:07,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:09:07,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:09:07,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:09:07,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:09:07,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:09:07,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:09:07,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:09:07,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:09:07,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:09:07,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:09:07,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:09:07,687 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 -> 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 [2025-03-17 06:09:07,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:09:07,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:09:07,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:09:07,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:09:07,931 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:09:07,932 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-46.i [2025-03-17 06:09:09,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ed6d15c/e808abc7fd164ad1a42b67ae5052797c/FLAG1e06cf613 [2025-03-17 06:09:09,489 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:09:09,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i [2025-03-17 06:09:09,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ed6d15c/e808abc7fd164ad1a42b67ae5052797c/FLAG1e06cf613 [2025-03-17 06:09:09,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ed6d15c/e808abc7fd164ad1a42b67ae5052797c [2025-03-17 06:09:09,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:09:09,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:09:09,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:09:09,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:09:09,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:09:09,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a77d0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09, skipping insertion in model container [2025-03-17 06:09:09,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:09:09,676 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-46.i[917,930] [2025-03-17 06:09:09,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:09:09,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:09:09,750 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-46.i[917,930] [2025-03-17 06:09:09,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:09:09,793 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:09:09,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09 WrapperNode [2025-03-17 06:09:09,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:09:09,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:09:09,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:09:09,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:09:09,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,837 INFO L138 Inliner]: procedures = 30, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2025-03-17 06:09:09,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:09:09,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:09:09,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:09:09,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:09:09,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,862 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:09:09,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:09:09,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:09:09,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:09:09,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:09:09,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (1/1) ... [2025-03-17 06:09:09,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:09:09,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:09:09,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:09:09,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:09:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:09:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:09:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:09:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:09:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:09:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:09:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:09:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:09:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:09:09,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:09:09,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:09:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:09:10,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:09:10,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:09:10,442 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~mem58#1;havoc property_#t~ite80#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~ite78#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~ite66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem71#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short70#1;havoc property_#t~mem73#1;havoc property_#t~ite77#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1; [2025-03-17 06:09:10,480 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-17 06:09:10,480 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:09:10,495 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:09:10,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:09:10,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:09:10 BoogieIcfgContainer [2025-03-17 06:09:10,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:09:10,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:09:10,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:09:10,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:09:10,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:09:09" (1/3) ... [2025-03-17 06:09:10,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb4e02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:09:10, skipping insertion in model container [2025-03-17 06:09:10,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:09" (2/3) ... [2025-03-17 06:09:10,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb4e02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:09:10, skipping insertion in model container [2025-03-17 06:09:10,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:09:10" (3/3) ... [2025-03-17 06:09:10,503 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-46.i [2025-03-17 06:09:10,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:09:10,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-46.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:09:10,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:09:10,581 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;@6af4139e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:09:10,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:09:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:09:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:09:10,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:10,594 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:10,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:10,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1608798311, now seen corresponding path program 1 times [2025-03-17 06:09:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:09:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224350850] [2025-03-17 06:09:10,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:09:10,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:10,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:10,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:10,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 06:09:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:09:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224350850] [2025-03-17 06:09:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224350850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:09:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519776830] [2025-03-17 06:09:10,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:10,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:09:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:09:10,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:09:10,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:09:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:11,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:11,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:11,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:11,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:09:11,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 06:09:11,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:09:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519776830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:09:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:09:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870834402] [2025-03-17 06:09:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:11,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:09:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:09:11,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:09:11,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:09:11,197 INFO L87 Difference]: Start difference. First operand has 95 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:09:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:11,226 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2025-03-17 06:09:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:09:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 06:09:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:11,233 INFO L225 Difference]: With dead ends: 187 [2025-03-17 06:09:11,234 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 06:09:11,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:09:11,240 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:11,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:09:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 06:09:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 06:09:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:09:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2025-03-17 06:09:11,280 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 112 [2025-03-17 06:09:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:11,280 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2025-03-17 06:09:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:09:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2025-03-17 06:09:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:09:11,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:11,284 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:11,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:09:11,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:09:11,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1820182041, now seen corresponding path program 1 times [2025-03-17 06:09:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:09:11,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665758100] [2025-03-17 06:09:11,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:09:11,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:11,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:09:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:09:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665758100] [2025-03-17 06:09:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665758100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:09:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:09:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395394002] [2025-03-17 06:09:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:09:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:09:15,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:09:15,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:09:15,791 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 06:09:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:16,672 INFO L93 Difference]: Finished difference Result 289 states and 422 transitions. [2025-03-17 06:09:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:09:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 112 [2025-03-17 06:09:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:16,676 INFO L225 Difference]: With dead ends: 289 [2025-03-17 06:09:16,676 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 06:09:16,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:09:16,678 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 306 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:16,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 474 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:09:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 06:09:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 154. [2025-03-17 06:09:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 122 states have internal predecessors, (167), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:09:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 223 transitions. [2025-03-17 06:09:16,711 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 223 transitions. Word has length 112 [2025-03-17 06:09:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:16,711 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 223 transitions. [2025-03-17 06:09:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 06:09:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 223 transitions. [2025-03-17 06:09:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:09:16,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:16,717 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:16,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:09:16,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:16,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2113585048, now seen corresponding path program 1 times [2025-03-17 06:09:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:09:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492510746] [2025-03-17 06:09:16,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:09:16,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:16,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:16,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:16,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:09:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:09:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492510746] [2025-03-17 06:09:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492510746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:09:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:09:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67210342] [2025-03-17 06:09:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:09:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:09:17,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:09:17,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:09:17,287 INFO L87 Difference]: Start difference. First operand 154 states and 223 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:09:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:17,590 INFO L93 Difference]: Finished difference Result 300 states and 435 transitions. [2025-03-17 06:09:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:09:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 06:09:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:17,592 INFO L225 Difference]: With dead ends: 300 [2025-03-17 06:09:17,592 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 06:09:17,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:09:17,598 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 313 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:17,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 413 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:09:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 06:09:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2025-03-17 06:09:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:09:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 251 transitions. [2025-03-17 06:09:17,636 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 251 transitions. Word has length 112 [2025-03-17 06:09:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:17,637 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 251 transitions. [2025-03-17 06:09:17,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:09:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2025-03-17 06:09:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:09:17,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:17,645 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:17,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:09:17,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:17,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1608831128, now seen corresponding path program 1 times [2025-03-17 06:09:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:09:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365086773] [2025-03-17 06:09:17,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:09:17,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:17,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:17,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:17,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:09:18,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:09:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365086773] [2025-03-17 06:09:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365086773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:18,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:09:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:09:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528161982] [2025-03-17 06:09:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:18,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:09:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:09:18,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:09:18,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:09:18,069 INFO L87 Difference]: Start difference. First operand 174 states and 251 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:18,545 INFO L93 Difference]: Finished difference Result 334 states and 481 transitions. [2025-03-17 06:09:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:09:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 06:09:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:18,548 INFO L225 Difference]: With dead ends: 334 [2025-03-17 06:09:18,548 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 06:09:18,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:09:18,549 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:18,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 545 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:09:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 06:09:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 178. [2025-03-17 06:09:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 146 states have internal predecessors, (201), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:09:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 257 transitions. [2025-03-17 06:09:18,592 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 257 transitions. Word has length 112 [2025-03-17 06:09:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:18,592 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 257 transitions. [2025-03-17 06:09:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 257 transitions. [2025-03-17 06:09:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:09:18,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:18,594 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:18,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:09:18,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:18,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash -101279319, now seen corresponding path program 1 times [2025-03-17 06:09:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:09:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107474710] [2025-03-17 06:09:18,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:09:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:18,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:18,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:18,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:09:19,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:09:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107474710] [2025-03-17 06:09:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107474710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:09:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:09:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557189722] [2025-03-17 06:09:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:09:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:09:19,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:09:19,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:09:19,414 INFO L87 Difference]: Start difference. First operand 178 states and 257 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:19,712 INFO L93 Difference]: Finished difference Result 328 states and 473 transitions. [2025-03-17 06:09:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:09:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 06:09:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:19,715 INFO L225 Difference]: With dead ends: 328 [2025-03-17 06:09:19,715 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 06:09:19,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:09:19,715 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 155 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:19,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 518 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:09:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 06:09:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2025-03-17 06:09:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 146 states have internal predecessors, (201), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:09:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 257 transitions. [2025-03-17 06:09:19,745 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 257 transitions. Word has length 112 [2025-03-17 06:09:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:19,746 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 257 transitions. [2025-03-17 06:09:19,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 257 transitions. [2025-03-17 06:09:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 06:09:19,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:19,747 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:19,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:09:19,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:19,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash -779910910, now seen corresponding path program 1 times [2025-03-17 06:09:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:09:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706861704] [2025-03-17 06:09:19,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:09:19,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 06:09:19,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 06:09:19,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:19,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:09:19,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833414495] [2025-03-17 06:09:19,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:19,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:09:19,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:09:19,834 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-17 06:09:19,853 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-17 06:09:19,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 06:09:20,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 06:09:20,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:20,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:09:20,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:09:20,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 06:09:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 06:09:21,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:21,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:09:21,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:09:21,275 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:09:21,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:09:21,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:09:21,478 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,SelfDestructingSolverStorable5 [2025-03-17 06:09:21,481 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 06:09:21,576 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:09:21,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:09:21 BoogieIcfgContainer [2025-03-17 06:09:21,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:09:21,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:09:21,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:09:21,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:09:21,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:09:10" (3/4) ... [2025-03-17 06:09:21,581 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:09:21,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:09:21,584 INFO L158 Benchmark]: Toolchain (without parser) took 12052.45ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 106.8MB in the beginning and 245.4MB in the end (delta: -138.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2025-03-17 06:09:21,584 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:09:21,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.11ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 91.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:09:21,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.27ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:09:21,585 INFO L158 Benchmark]: Boogie Preprocessor took 43.15ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:09:21,585 INFO L158 Benchmark]: IcfgBuilder took 613.12ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 54.7MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:09:21,585 INFO L158 Benchmark]: TraceAbstraction took 11080.49ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 54.7MB in the beginning and 245.5MB in the end (delta: -190.9MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-17 06:09:21,585 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 360.7MB. Free memory was 245.5MB in the beginning and 245.4MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:09:21,588 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.11ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 91.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.27ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.15ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 613.12ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 54.7MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11080.49ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 54.7MB in the beginning and 245.5MB in the end (delta: -190.9MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 360.7MB. Free memory was 245.5MB in the beginning and 245.4MB in the end (delta: 110.8kB). 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 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L49] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] double* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L51] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L52] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] signed short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] signed short int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L58] signed char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L59] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L60] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L61] signed short int last_1_WrapperStruct00_var_1_10 = -4; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L123] EXPR WrapperStruct00.var_1_1 [L123] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_10 [L124] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L100] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_2 [L101] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_2 [L101] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L114] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L115] WrapperStruct00.var_1_12 = __VERIFIER_nondet_short() [L116] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L117] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L135] RET updateVariables() [L136] CALL step() [L65] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L65] COND FALSE !(last_1_WrapperStruct00_var_1_10 <= ((*(WrapperStruct00_var_1_12_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)))) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L70] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L70] signed long int stepLocal_1 = ((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))); [L71] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L71] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-27] [L72] COND TRUE (- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75 [L73] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-27] [L73] COND TRUE stepLocal_0 >= (*(WrapperStruct00_var_1_13_Pointer)) [L74] COND TRUE stepLocal_1 > -32 [L75] (*(WrapperStruct00_var_1_1_Pointer)) = 0 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] signed char stepLocal_2 = (*(WrapperStruct00_var_1_13_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L90] EXPR (*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L90] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L90] COND TRUE (((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < stepLocal_2 [L91] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L91] (*(WrapperStruct00_var_1_10_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - 256) [L95] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L95] COND FALSE !(1 == (*(WrapperStruct00_var_1_4_Pointer))) [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR ((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) [L127] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L127] EXPR ((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR (((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR ((((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) && (((((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_12_Pointer)) - 256))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) 128))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR (((((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) && (((((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_12_Pointer)) - 256))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= ((*(WrapperStruct00_var_1_12_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)))) ? (last_1_WrapperStruct00_var_1_1 ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127-L128] return (((((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) && (((((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_12_Pointer)) - 256))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= ((*(WrapperStruct00_var_1_12_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)))) ? (last_1_WrapperStruct00_var_1_1 ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 154 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 949 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 2084 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1511 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1599 IncrementalHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 573 mSDtfsCounter, 1599 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 167 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 6425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2158/2184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:09:21,609 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-46.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 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:09:23,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:09:23,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:09:23,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:09:23,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:09:23,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:09:23,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:09:23,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:09:23,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:09:23,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:09:23,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:09:23,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:09:23,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:09:23,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:09:23,966 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:09:23,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:09:23,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:09:23,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:09:23,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:09:23,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:09:23,968 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 -> 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 [2025-03-17 06:09:24,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:09:24,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:09:24,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:09:24,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:09:24,298 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:09:24,299 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-46.i [2025-03-17 06:09:25,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4666c8b4/a719a6674bb84ea3b88dbc092b78651b/FLAG5a9b27d95 [2025-03-17 06:09:25,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:09:25,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i [2025-03-17 06:09:25,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4666c8b4/a719a6674bb84ea3b88dbc092b78651b/FLAG5a9b27d95 [2025-03-17 06:09:25,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4666c8b4/a719a6674bb84ea3b88dbc092b78651b [2025-03-17 06:09:25,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:09:25,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:09:25,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:09:25,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:09:25,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:09:25,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:09:25" (1/1) ... [2025-03-17 06:09:25,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e679f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:25, skipping insertion in model container [2025-03-17 06:09:25,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:09:25" (1/1) ... [2025-03-17 06:09:25,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:09:25,948 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-46.i[917,930] [2025-03-17 06:09:26,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:09:26,030 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:09:26,039 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-46.i[917,930] [2025-03-17 06:09:26,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:09:26,102 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:09:26,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26 WrapperNode [2025-03-17 06:09:26,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:09:26,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:09:26,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:09:26,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:09:26,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,154 INFO L138 Inliner]: procedures = 34, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 384 [2025-03-17 06:09:26,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:09:26,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:09:26,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:09:26,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:09:26,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,182 INFO L175 MemorySlicer]: Split 102 memory accesses to 2 slices as follows [2, 100]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-03-17 06:09:26,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:09:26,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:09:26,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:09:26,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:09:26,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (1/1) ... [2025-03-17 06:09:26,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:09:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:09:26,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:09:26,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:09:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:09:26,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:09:26,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:09:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:09:26,367 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:09:26,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:09:27,067 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~mem57#1;havoc property_#t~ite79#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite77#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~short69#1;havoc property_#t~mem72#1;havoc property_#t~ite76#1;havoc property_#t~mem73#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short100#1; [2025-03-17 06:09:27,098 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-17 06:09:27,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:09:27,106 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:09:27,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:09:27,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:09:27 BoogieIcfgContainer [2025-03-17 06:09:27,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:09:27,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:09:27,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:09:27,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:09:27,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:09:25" (1/3) ... [2025-03-17 06:09:27,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763fe6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:09:27, skipping insertion in model container [2025-03-17 06:09:27,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:09:26" (2/3) ... [2025-03-17 06:09:27,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763fe6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:09:27, skipping insertion in model container [2025-03-17 06:09:27,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:09:27" (3/3) ... [2025-03-17 06:09:27,115 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-46.i [2025-03-17 06:09:27,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:09:27,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-46.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:09:27,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:09:27,200 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;@326872de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:09:27,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:09:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:09:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 06:09:27,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:27,221 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:27,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1756912858, now seen corresponding path program 1 times [2025-03-17 06:09:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:09:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328167803] [2025-03-17 06:09:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:09:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:09:27,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:09:27,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:09:27,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 06:09:27,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 06:09:27,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:27,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:27,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:09:27,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-17 06:09:27,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:09:27,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:09:27,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328167803] [2025-03-17 06:09:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328167803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:27,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:09:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:09:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011181497] [2025-03-17 06:09:27,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:09:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:09:27,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:09:27,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:09:27,598 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:09:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:27,617 INFO L93 Difference]: Finished difference Result 171 states and 268 transitions. [2025-03-17 06:09:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:09:27,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-17 06:09:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:27,625 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:09:27,625 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:09:27,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:09:27,630 INFO L435 NwaCegarLoop]: 124 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, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:27,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:09:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:09:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:09:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:09:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2025-03-17 06:09:27,666 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 110 [2025-03-17 06:09:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2025-03-17 06:09:27,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:09:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2025-03-17 06:09:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 06:09:27,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:27,669 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:27,678 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-17 06:09:27,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:09:27,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:27,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1480038156, now seen corresponding path program 1 times [2025-03-17 06:09:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:09:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966434196] [2025-03-17 06:09:27,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:27,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:09:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:09:27,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:09:27,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:09:27,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 06:09:28,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 06:09:28,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:28,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:28,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:09:28,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:09:28,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:09:28,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:09:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966434196] [2025-03-17 06:09:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966434196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:09:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:09:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352450885] [2025-03-17 06:09:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:09:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:09:28,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:09:28,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:09:28,196 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:28,243 INFO L93 Difference]: Finished difference Result 171 states and 250 transitions. [2025-03-17 06:09:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:09:28,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 06:09:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:28,245 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:09:28,245 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:09:28,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:09:28,246 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:28,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:09:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:09:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 06:09:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:09:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2025-03-17 06:09:28,254 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 110 [2025-03-17 06:09:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:28,254 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2025-03-17 06:09:28,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2025-03-17 06:09:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 06:09:28,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:28,256 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:28,267 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:09:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:09:28,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:28,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash -493455467, now seen corresponding path program 1 times [2025-03-17 06:09:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:09:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921323701] [2025-03-17 06:09:28,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:28,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:09:28,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:09:28,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:09:28,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:09:28,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 06:09:28,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 06:09:28,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:28,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 06:09:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:28,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:28,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 46 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2025-03-17 06:09:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2025-03-17 06:09:29,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2025-03-17 06:09:31,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2025-03-17 06:09:32,124 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 64 treesize of output 67 [2025-03-17 06:09:32,892 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 64 treesize of output 67 [2025-03-17 06:09:33,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2025-03-17 06:09:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2025-03-17 06:09:34,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2025-03-17 06:09:35,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:09:35,050 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 15 case distinctions, treesize of input 76 treesize of output 75 [2025-03-17 06:09:35,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:09:35,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 37 [2025-03-17 06:09:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 272 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 06:09:35,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:09:35,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:09:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921323701] [2025-03-17 06:09:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921323701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:09:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1683332579] [2025-03-17 06:09:35,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:35,539 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:09:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:09:35,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:09:35,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 06:09:35,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 06:09:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 06:09:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:36,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 06:09:36,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:37,581 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 12 treesize of output 8 [2025-03-17 06:09:37,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 06:09:37,750 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-03-17 06:09:37,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2025-03-17 06:09:37,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2025-03-17 06:09:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:09:37,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:09:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1683332579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:09:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:09:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2025-03-17 06:09:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366739824] [2025-03-17 06:09:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:09:37,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:09:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:09:37,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:09:37,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:09:37,934 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:09:38,965 INFO L93 Difference]: Finished difference Result 245 states and 353 transitions. [2025-03-17 06:09:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:09:38,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 06:09:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:09:38,967 INFO L225 Difference]: With dead ends: 245 [2025-03-17 06:09:38,967 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 06:09:38,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2025-03-17 06:09:38,968 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 207 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:09:38,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 458 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:09:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 06:09:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2025-03-17 06:09:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:09:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-17 06:09:38,980 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 110 [2025-03-17 06:09:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:09:38,981 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-17 06:09:38,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:09:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-17 06:09:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:09:38,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:09:38,982 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:09:38,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 06:09:39,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:09:39,382 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 06:09:39,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:09:39,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:09:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1674306515, now seen corresponding path program 1 times [2025-03-17 06:09:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:09:39,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218668072] [2025-03-17 06:09:39,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:39,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:09:39,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:09:39,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:09:39,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:09:39,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:39,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:39,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:39,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:39,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 06:09:39,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:39,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:09:39,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 51 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2025-03-17 06:09:39,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2025-03-17 06:09:40,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2025-03-17 06:09:41,114 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 61 treesize of output 75 [2025-03-17 06:09:41,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2025-03-17 06:09:42,342 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 64 treesize of output 67 [2025-03-17 06:09:42,907 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 64 treesize of output 67 [2025-03-17 06:09:43,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2025-03-17 06:09:44,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2025-03-17 06:09:44,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:09:44,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 56 [2025-03-17 06:09:44,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:09:44,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 29 [2025-03-17 06:09:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 260 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 06:09:44,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:09:44,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:09:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218668072] [2025-03-17 06:09:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218668072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:09:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [999843757] [2025-03-17 06:09:44,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:09:44,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:09:44,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:09:44,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:09:44,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 06:09:44,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:09:45,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:09:45,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:09:45,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:09:45,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 06:09:45,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:09:45,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 8 [2025-03-17 06:09:45,797 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 25 treesize of output 28 [2025-03-17 06:09:48,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-03-17 06:09:49,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2025-03-17 06:09:50,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2025-03-17 06:09:50,755 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 61 treesize of output 75 [2025-03-17 06:09:51,556 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 69 treesize of output 86 [2025-03-17 06:09:52,352 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 80 treesize of output 89 [2025-03-17 06:09:53,582 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 95 treesize of output 96 [2025-03-17 06:09:53,790 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 92 treesize of output 97 [2025-03-17 06:09:53,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 37 [2025-03-17 06:09:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 236 proven. 96 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 06:09:53,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:09:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [999843757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:09:54,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:09:54,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2025-03-17 06:09:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050110239] [2025-03-17 06:09:54,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:09:54,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 06:09:54,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:09:54,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 06:09:54,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=738, Unknown=1, NotChecked=0, Total=870 [2025-03-17 06:09:54,205 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 23 states have internal predecessors, (107), 12 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) [2025-03-17 06:10:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:10:04,073 INFO L93 Difference]: Finished difference Result 478 states and 679 transitions. [2025-03-17 06:10:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:10:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 23 states have internal predecessors, (107), 12 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) Word has length 112 [2025-03-17 06:10:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:10:04,077 INFO L225 Difference]: With dead ends: 478 [2025-03-17 06:10:04,077 INFO L226 Difference]: Without dead ends: 384 [2025-03-17 06:10:04,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=335, Invalid=1304, Unknown=1, NotChecked=0, Total=1640 [2025-03-17 06:10:04,081 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 753 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:10:04,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 895 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-03-17 06:10:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-17 06:10:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2025-03-17 06:10:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 248 states have (on average 1.3548387096774193) internal successors, (336), 250 states have internal predecessors, (336), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 06:10:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 422 transitions. [2025-03-17 06:10:04,138 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 422 transitions. Word has length 112 [2025-03-17 06:10:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:10:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 422 transitions. [2025-03-17 06:10:04,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 23 states have internal predecessors, (107), 12 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) [2025-03-17 06:10:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 422 transitions. [2025-03-17 06:10:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 06:10:04,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:10:04,141 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:10:04,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 06:10:04,352 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 (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:10:04,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:10:04,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:10:04,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:10:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1380903508, now seen corresponding path program 1 times [2025-03-17 06:10:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:10:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104223618] [2025-03-17 06:10:04,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:10:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:10:04,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:10:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:10:04,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:10:04,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:10:04,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:04,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:04,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 06:10:04,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:10:04,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 06:10:05,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-03-17 06:10:06,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 71 [2025-03-17 06:10:07,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-03-17 06:10:08,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2025-03-17 06:10:08,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2025-03-17 06:10:09,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2025-03-17 06:10:10,461 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 106 treesize of output 85 [2025-03-17 06:10:10,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:10:10,663 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 15 case distinctions, treesize of input 106 treesize of output 85 [2025-03-17 06:10:10,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:10:10,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 58 [2025-03-17 06:10:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 208 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 06:10:12,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:10:13,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:10:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104223618] [2025-03-17 06:10:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104223618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:10:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427296876] [2025-03-17 06:10:13,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:10:13,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:10:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:10:13,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:10:13,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 06:10:13,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 06:10:14,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 06:10:14,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:10:14,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:10:14,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 06:10:14,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:10:14,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:10:14,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 57 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 73 [2025-03-17 06:10:14,822 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 92 treesize of output 108 [2025-03-17 06:10:17,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 112 [2025-03-17 06:10:19,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 112 [2025-03-17 06:10:22,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 104 [2025-03-17 06:10:25,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 101 [2025-03-17 06:10:28,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 101 [2025-03-17 06:10:31,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 93 [2025-03-17 06:10:37,656 INFO L349 Elim1Store]: treesize reduction 9, result has 90.7 percent of original size [2025-03-17 06:10:37,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 105 treesize of output 140