./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.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-67.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 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:11:49,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:11:49,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:11:49,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:11:49,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:11:49,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:11:49,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:11:49,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:11:49,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:11:49,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:11:49,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:11:49,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:11:49,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:11:49,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:11:49,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:11:49,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:11:49,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:11:49,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:11:49,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:49,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:11:49,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:11:49,853 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 -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2025-03-17 06:11:50,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:11:50,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:11:50,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:11:50,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:11:50,112 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:11:50,112 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-67.i [2025-03-17 06:11:51,272 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5224a73/f7d7e36033d042249885effbb7c59bf0/FLAG96a116eae [2025-03-17 06:11:51,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:11:51,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2025-03-17 06:11:51,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5224a73/f7d7e36033d042249885effbb7c59bf0/FLAG96a116eae [2025-03-17 06:11:51,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce5224a73/f7d7e36033d042249885effbb7c59bf0 [2025-03-17 06:11:51,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:11:51,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:11:51,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:51,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:11:51,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:11:51,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1577f87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51, skipping insertion in model container [2025-03-17 06:11:51,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:11:51,683 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-67.i[917,930] [2025-03-17 06:11:51,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:51,741 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:11:51,748 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-67.i[917,930] [2025-03-17 06:11:51,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:51,793 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:11:51,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51 WrapperNode [2025-03-17 06:11:51,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:51,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:51,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:11:51,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:11:51,799 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:11:51" (1/1) ... [2025-03-17 06:11:51,806 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:11:51" (1/1) ... [2025-03-17 06:11:51,830 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2025-03-17 06:11:51,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:51,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:11:51,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:11:51,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:11:51,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,847 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:11:51,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:11:51,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:11:51,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:11:51,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:11:51,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (1/1) ... [2025-03-17 06:11:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:51,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:51,894 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:11:51,897 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:11:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:11:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:11:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:11:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:11:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:11:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:11:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:11:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:11:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:11:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:11:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:11:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:11:52,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:11:52,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:11:52,341 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~ite62#1;havoc property_#t~mem61#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~short74#1;havoc property_#t~mem75#1;havoc property_#t~ite96#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite95#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short97#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~short106#1; [2025-03-17 06:11:52,377 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-17 06:11:52,378 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:11:52,392 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:11:52,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:11:52,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:52 BoogieIcfgContainer [2025-03-17 06:11:52,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:11:52,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:11:52,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:11:52,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:11:52,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:11:51" (1/3) ... [2025-03-17 06:11:52,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232cd58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:52, skipping insertion in model container [2025-03-17 06:11:52,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:51" (2/3) ... [2025-03-17 06:11:52,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232cd58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:52, skipping insertion in model container [2025-03-17 06:11:52,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:52" (3/3) ... [2025-03-17 06:11:52,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2025-03-17 06:11:52,416 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:11:52,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-67.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:11:52,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:11:52,479 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;@56bfcc36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:11:52,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:11:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:11:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 06:11:52,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:52,495 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:52,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:52,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash 806885293, now seen corresponding path program 1 times [2025-03-17 06:11:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283972103] [2025-03-17 06:11:52,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:11:52,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:11:52,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 06:11:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283972103] [2025-03-17 06:11:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283972103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331185701] [2025-03-17 06:11:52,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:52,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:52,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:52,838 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:11:52,840 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:11:52,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:11:53,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:11:53,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:53,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:53,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:11:53,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 06:11:53,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331185701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:53,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:11:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471132832] [2025-03-17 06:11:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:53,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:11:53,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:53,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:11:53,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:53,062 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 06:11:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:53,078 INFO L93 Difference]: Finished difference Result 171 states and 262 transitions. [2025-03-17 06:11:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:11:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-17 06:11:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:53,084 INFO L225 Difference]: With dead ends: 171 [2025-03-17 06:11:53,084 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:11:53,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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:11:53,088 INFO L435 NwaCegarLoop]: 120 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, 120 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:11:53,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:11:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 06:11:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:11:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-03-17 06:11:53,111 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 100 [2025-03-17 06:11:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:53,112 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-03-17 06:11:53,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 06:11:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-03-17 06:11:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 06:11:53,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:53,114 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:53,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:53,315 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:11:53,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1528491581, now seen corresponding path program 1 times [2025-03-17 06:11:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:53,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725864248] [2025-03-17 06:11:53,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:53,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:11:53,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:11:53,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:53,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:11:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725864248] [2025-03-17 06:11:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725864248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:11:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720298613] [2025-03-17 06:11:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:53,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:53,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:53,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:53,593 INFO L87 Difference]: Start difference. First operand 85 states and 122 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:11:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:53,640 INFO L93 Difference]: Finished difference Result 172 states and 247 transitions. [2025-03-17 06:11:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:53,642 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-03-17 06:11:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:53,643 INFO L225 Difference]: With dead ends: 172 [2025-03-17 06:11:53,643 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 06:11:53,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:53,644 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:53,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 06:11:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-17 06:11:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:11:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-03-17 06:11:53,658 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 100 [2025-03-17 06:11:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:53,660 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-03-17 06:11:53,660 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:11:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-03-17 06:11:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 06:11:53,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:53,663 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:53,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:11:53,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash 959021252, now seen corresponding path program 1 times [2025-03-17 06:11:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448191524] [2025-03-17 06:11:53,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:11:53,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:11:53,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:53,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:11:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:53,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448191524] [2025-03-17 06:11:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448191524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:53,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:53,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:11:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397659062] [2025-03-17 06:11:53,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:53,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:53,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:53,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:53,846 INFO L87 Difference]: Start difference. First operand 87 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:11:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:53,882 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2025-03-17 06:11:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:53,882 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-03-17 06:11:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:53,883 INFO L225 Difference]: With dead ends: 176 [2025-03-17 06:11:53,883 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 06:11:53,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:53,884 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:53,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 06:11:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-17 06:11:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:11:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-03-17 06:11:53,890 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 100 [2025-03-17 06:11:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:53,890 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-03-17 06:11:53,890 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:11:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-03-17 06:11:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 06:11:53,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:53,891 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:11:53,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:53,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1846524933, now seen corresponding path program 1 times [2025-03-17 06:11:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842864235] [2025-03-17 06:11:53,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:53,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:11:53,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:11:53,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:11:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842864235] [2025-03-17 06:11:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842864235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:54,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:54,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:11:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059662182] [2025-03-17 06:11:54,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:54,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:54,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:54,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:54,005 INFO L87 Difference]: Start difference. First operand 89 states and 126 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:11:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:54,025 INFO L93 Difference]: Finished difference Result 180 states and 255 transitions. [2025-03-17 06:11:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:54,025 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-03-17 06:11:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:54,026 INFO L225 Difference]: With dead ends: 180 [2025-03-17 06:11:54,026 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 06:11:54,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:54,027 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:54,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 06:11:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 06:11:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:11:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-03-17 06:11:54,036 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 100 [2025-03-17 06:11:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-03-17 06:11:54,037 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:11:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-03-17 06:11:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 06:11:54,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:54,049 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:11:54,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:54,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1847448454, now seen corresponding path program 1 times [2025-03-17 06:11:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163122088] [2025-03-17 06:11:54,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:54,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:11:54,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:11:54,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:54,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:02,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:02,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163122088] [2025-03-17 06:12:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163122088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:02,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:12:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693064013] [2025-03-17 06:12:02,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:02,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:12:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:02,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:12:02,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:12:02,269 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:12:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:05,211 INFO L93 Difference]: Finished difference Result 305 states and 423 transitions. [2025-03-17 06:12:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:12:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 100 [2025-03-17 06:12:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:05,213 INFO L225 Difference]: With dead ends: 305 [2025-03-17 06:12:05,213 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 06:12:05,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:12:05,214 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 254 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:05,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 874 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 06:12:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 06:12:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 110. [2025-03-17 06:12:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2025-03-17 06:12:05,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 100 [2025-03-17 06:12:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2025-03-17 06:12:05,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:12:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2025-03-17 06:12:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 06:12:05,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:05,229 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:12:05,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1202754361, now seen corresponding path program 1 times [2025-03-17 06:12:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:05,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500207192] [2025-03-17 06:12:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:05,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 06:12:05,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 06:12:05,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500207192] [2025-03-17 06:12:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500207192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:05,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:05,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:12:05,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307478453] [2025-03-17 06:12:05,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:05,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:12:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:05,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:12:05,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:12:05,286 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:05,332 INFO L93 Difference]: Finished difference Result 273 states and 381 transitions. [2025-03-17 06:12:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:12:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-03-17 06:12:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:05,333 INFO L225 Difference]: With dead ends: 273 [2025-03-17 06:12:05,333 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 06:12:05,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:12:05,334 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:05,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 301 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 06:12:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 124. [2025-03-17 06:12:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 175 transitions. [2025-03-17 06:12:05,349 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 175 transitions. Word has length 100 [2025-03-17 06:12:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:05,349 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 175 transitions. [2025-03-17 06:12:05,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2025-03-17 06:12:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 06:12:05,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:05,350 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:12:05,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:05,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:05,350 INFO L85 PathProgramCache]: Analyzing trace with hash -301725469, now seen corresponding path program 1 times [2025-03-17 06:12:05,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:05,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236848196] [2025-03-17 06:12:05,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:05,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:05,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 06:12:05,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 06:12:05,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:05,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236848196] [2025-03-17 06:12:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236848196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:12:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755747769] [2025-03-17 06:12:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:09,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:12:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:09,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:12:09,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:09,836 INFO L87 Difference]: Start difference. First operand 124 states and 175 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:10,949 INFO L93 Difference]: Finished difference Result 287 states and 401 transitions. [2025-03-17 06:12:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-03-17 06:12:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:10,951 INFO L225 Difference]: With dead ends: 287 [2025-03-17 06:12:10,952 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 06:12:10,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:12:10,953 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 417 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:10,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 281 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 06:12:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 111. [2025-03-17 06:12:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2025-03-17 06:12:10,968 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 101 [2025-03-17 06:12:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:10,968 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2025-03-17 06:12:10,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2025-03-17 06:12:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:12:10,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:10,969 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:10,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:12:10,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1180794495, now seen corresponding path program 1 times [2025-03-17 06:12:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:10,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116948575] [2025-03-17 06:12:10,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:10,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:12:11,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:12:11,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:11,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:11,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:11,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116948575] [2025-03-17 06:12:11,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116948575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:11,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:11,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802043629] [2025-03-17 06:12:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:11,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:11,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:11,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:11,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:11,910 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:12,395 INFO L93 Difference]: Finished difference Result 284 states and 394 transitions. [2025-03-17 06:12:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:12,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 06:12:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:12,397 INFO L225 Difference]: With dead ends: 284 [2025-03-17 06:12:12,397 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 06:12:12,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:12,398 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 255 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:12,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 468 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 06:12:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2025-03-17 06:12:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2025-03-17 06:12:12,429 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 104 [2025-03-17 06:12:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:12,430 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2025-03-17 06:12:12,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2025-03-17 06:12:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 06:12:12,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:12,432 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:12,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:12:12,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2045882367, now seen corresponding path program 1 times [2025-03-17 06:12:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386841535] [2025-03-17 06:12:12,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:12,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 06:12:12,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 06:12:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386841535] [2025-03-17 06:12:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386841535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:13,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:13,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:12:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095144752] [2025-03-17 06:12:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:13,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:13,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:13,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:13,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:13,576 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:14,252 INFO L93 Difference]: Finished difference Result 315 states and 438 transitions. [2025-03-17 06:12:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-17 06:12:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:14,254 INFO L225 Difference]: With dead ends: 315 [2025-03-17 06:12:14,254 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 06:12:14,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:14,255 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 259 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:14,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 536 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 06:12:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2025-03-17 06:12:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2025-03-17 06:12:14,275 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 106 [2025-03-17 06:12:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:14,276 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2025-03-17 06:12:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2025-03-17 06:12:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 06:12:14,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:14,277 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:12:14,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 517721505, now seen corresponding path program 1 times [2025-03-17 06:12:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916587534] [2025-03-17 06:12:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:14,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 06:12:14,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 06:12:14,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:14,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916587534] [2025-03-17 06:12:15,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916587534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:15,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:12:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963482120] [2025-03-17 06:12:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:15,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:12:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:15,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:12:15,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:15,894 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 06:12:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:16,622 INFO L93 Difference]: Finished difference Result 341 states and 476 transitions. [2025-03-17 06:12:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-03-17 06:12:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:16,624 INFO L225 Difference]: With dead ends: 341 [2025-03-17 06:12:16,624 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 06:12:16,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:12:16,625 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 371 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:16,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 389 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 06:12:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 170. [2025-03-17 06:12:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 155 states have (on average 1.3935483870967742) internal successors, (216), 155 states have internal predecessors, (216), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2025-03-17 06:12:16,654 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 106 [2025-03-17 06:12:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2025-03-17 06:12:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 06:12:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2025-03-17 06:12:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:12:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:16,657 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:16,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:12:16,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:16,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:16,657 INFO L85 PathProgramCache]: Analyzing trace with hash -677693137, now seen corresponding path program 1 times [2025-03-17 06:12:16,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:16,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737175436] [2025-03-17 06:12:16,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:16,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:12:16,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:12:16,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737175436] [2025-03-17 06:12:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737175436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:17,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:17,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361437047] [2025-03-17 06:12:17,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:17,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:17,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:17,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:17,625 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:18,099 INFO L93 Difference]: Finished difference Result 404 states and 568 transitions. [2025-03-17 06:12:18,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:18,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 06:12:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:18,101 INFO L225 Difference]: With dead ends: 404 [2025-03-17 06:12:18,101 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 06:12:18,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:18,102 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 247 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:18,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 335 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 06:12:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 196. [2025-03-17 06:12:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 181 states have internal predecessors, (254), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions. [2025-03-17 06:12:18,120 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 278 transitions. Word has length 107 [2025-03-17 06:12:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:18,121 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 278 transitions. [2025-03-17 06:12:18,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 278 transitions. [2025-03-17 06:12:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:12:18,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:18,122 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:18,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:12:18,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:18,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2083113278, now seen corresponding path program 1 times [2025-03-17 06:12:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:18,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071599615] [2025-03-17 06:12:18,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:18,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:12:18,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:12:18,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:18,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071599615] [2025-03-17 06:12:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071599615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:19,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921813652] [2025-03-17 06:12:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:19,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:19,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:19,010 INFO L87 Difference]: Start difference. First operand 196 states and 278 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:19,333 INFO L93 Difference]: Finished difference Result 428 states and 602 transitions. [2025-03-17 06:12:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 06:12:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:19,335 INFO L225 Difference]: With dead ends: 428 [2025-03-17 06:12:19,335 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 06:12:19,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:19,336 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 144 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:19,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 388 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 06:12:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2025-03-17 06:12:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 181 states have (on average 1.3922651933701657) internal successors, (252), 181 states have internal predecessors, (252), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 276 transitions. [2025-03-17 06:12:19,356 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 276 transitions. Word has length 107 [2025-03-17 06:12:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:19,356 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 276 transitions. [2025-03-17 06:12:19,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 276 transitions. [2025-03-17 06:12:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 06:12:19,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:19,357 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:19,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:12:19,357 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash 647644835, now seen corresponding path program 1 times [2025-03-17 06:12:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452598478] [2025-03-17 06:12:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:19,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:19,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:19,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:19,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452598478] [2025-03-17 06:12:21,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452598478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:21,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:21,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 06:12:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41963112] [2025-03-17 06:12:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:21,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:12:21,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:21,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:12:21,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:21,137 INFO L87 Difference]: Start difference. First operand 196 states and 276 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:22,431 INFO L93 Difference]: Finished difference Result 484 states and 678 transitions. [2025-03-17 06:12:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:12:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-17 06:12:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:22,433 INFO L225 Difference]: With dead ends: 484 [2025-03-17 06:12:22,433 INFO L226 Difference]: Without dead ends: 289 [2025-03-17 06:12:22,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2025-03-17 06:12:22,434 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 333 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:22,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 724 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:12:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-17 06:12:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 253. [2025-03-17 06:12:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 238 states have (on average 1.3991596638655461) internal successors, (333), 238 states have internal predecessors, (333), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 357 transitions. [2025-03-17 06:12:22,452 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 357 transitions. Word has length 108 [2025-03-17 06:12:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:22,452 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 357 transitions. [2025-03-17 06:12:22,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 357 transitions. [2025-03-17 06:12:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 06:12:22,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:22,454 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:12:22,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2139770652, now seen corresponding path program 1 times [2025-03-17 06:12:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502713076] [2025-03-17 06:12:22,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:22,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502713076] [2025-03-17 06:12:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502713076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:23,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:12:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769621653] [2025-03-17 06:12:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:23,422 INFO L87 Difference]: Start difference. First operand 253 states and 357 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:23,947 INFO L93 Difference]: Finished difference Result 556 states and 775 transitions. [2025-03-17 06:12:23,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:23,948 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-17 06:12:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:23,949 INFO L225 Difference]: With dead ends: 556 [2025-03-17 06:12:23,949 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 06:12:23,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:12:23,950 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 391 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:23,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 421 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 06:12:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2025-03-17 06:12:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 280 states have (on average 1.3714285714285714) internal successors, (384), 281 states have internal predecessors, (384), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:12:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 416 transitions. [2025-03-17 06:12:23,988 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 416 transitions. Word has length 108 [2025-03-17 06:12:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 416 transitions. [2025-03-17 06:12:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 416 transitions. [2025-03-17 06:12:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 06:12:23,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:23,989 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:23,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:12:23,989 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:23,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1609258852, now seen corresponding path program 1 times [2025-03-17 06:12:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:23,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696055363] [2025-03-17 06:12:23,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:24,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:24,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:24,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:24,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:25,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:25,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696055363] [2025-03-17 06:12:25,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696055363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:25,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:25,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:12:25,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729695686] [2025-03-17 06:12:25,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:25,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:12:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:25,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:12:25,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:25,080 INFO L87 Difference]: Start difference. First operand 301 states and 416 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:25,805 INFO L93 Difference]: Finished difference Result 651 states and 893 transitions. [2025-03-17 06:12:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-17 06:12:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:25,810 INFO L225 Difference]: With dead ends: 651 [2025-03-17 06:12:25,810 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 06:12:25,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:25,811 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 179 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:25,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 490 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 06:12:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 303. [2025-03-17 06:12:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 282 states have (on average 1.3687943262411348) internal successors, (386), 283 states have internal predecessors, (386), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:12:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 418 transitions. [2025-03-17 06:12:25,842 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 418 transitions. Word has length 108 [2025-03-17 06:12:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:25,842 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 418 transitions. [2025-03-17 06:12:25,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 06:12:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 418 transitions. [2025-03-17 06:12:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 06:12:25,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:25,843 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:12:25,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:25,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1178156635, now seen corresponding path program 1 times [2025-03-17 06:12:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693349325] [2025-03-17 06:12:25,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:25,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:25,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:25,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:25,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:26,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693349325] [2025-03-17 06:12:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693349325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:12:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924969842] [2025-03-17 06:12:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:26,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:12:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:26,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:12:26,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:26,500 INFO L87 Difference]: Start difference. First operand 303 states and 418 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:26,915 INFO L93 Difference]: Finished difference Result 640 states and 880 transitions. [2025-03-17 06:12:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:12:26,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-17 06:12:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:26,917 INFO L225 Difference]: With dead ends: 640 [2025-03-17 06:12:26,917 INFO L226 Difference]: Without dead ends: 338 [2025-03-17 06:12:26,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:12:26,918 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 197 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:26,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 715 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-17 06:12:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 302. [2025-03-17 06:12:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.3701067615658362) internal successors, (385), 282 states have internal predecessors, (385), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:12:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 417 transitions. [2025-03-17 06:12:26,947 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 417 transitions. Word has length 108 [2025-03-17 06:12:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:26,948 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 417 transitions. [2025-03-17 06:12:26,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 417 transitions. [2025-03-17 06:12:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 06:12:26,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:26,949 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:12:26,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1129950635, now seen corresponding path program 1 times [2025-03-17 06:12:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993177978] [2025-03-17 06:12:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:26,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:27,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:27,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:27,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993177978] [2025-03-17 06:12:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993177978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570712936] [2025-03-17 06:12:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:27,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:12:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:12:27,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:27,460 INFO L87 Difference]: Start difference. First operand 302 states and 417 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:27,813 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2025-03-17 06:12:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-17 06:12:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:27,815 INFO L225 Difference]: With dead ends: 311 [2025-03-17 06:12:27,815 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 06:12:27,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:27,815 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 85 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:27,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 459 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 06:12:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2025-03-17 06:12:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 287 states have (on average 1.362369337979094) internal successors, (391), 288 states have internal predecessors, (391), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 06:12:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 423 transitions. [2025-03-17 06:12:27,844 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 423 transitions. Word has length 108 [2025-03-17 06:12:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:27,845 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 423 transitions. [2025-03-17 06:12:27,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 423 transitions. [2025-03-17 06:12:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 06:12:27,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:27,845 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:27,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:12:27,845 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:27,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1129027114, now seen corresponding path program 1 times [2025-03-17 06:12:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:27,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600118931] [2025-03-17 06:12:27,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:28,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:28,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:28,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:12:28,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856293606] [2025-03-17 06:12:28,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:28,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:28,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:28,038 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:12:28,039 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:12:28,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:28,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:28,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:28,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:28,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:12:28,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 06:12:29,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 06:12:29,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:29,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:29,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:12:29,541 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:12:29,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:12:29,556 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:12:29,744 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,SelfDestructingSolverStorable17 [2025-03-17 06:12:29,747 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:29,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:12:29,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:12:29 BoogieIcfgContainer [2025-03-17 06:12:29,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:12:29,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:12:29,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:12:29,868 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:12:29,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:52" (3/4) ... [2025-03-17 06:12:29,870 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:12:29,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:12:29,872 INFO L158 Benchmark]: Toolchain (without parser) took 38317.62ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 111.7MB in the beginning and 113.5MB in the end (delta: -1.8MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2025-03-17 06:12:29,872 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:29,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.24ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 96.5MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:12:29,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:29,873 INFO L158 Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:29,873 INFO L158 Benchmark]: IcfgBuilder took 530.60ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 60.7MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:12:29,873 INFO L158 Benchmark]: TraceAbstraction took 37469.74ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 60.2MB in the beginning and 113.5MB in the end (delta: -53.3MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2025-03-17 06:12:29,873 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 113.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:29,874 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.54ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.24ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 96.5MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.15ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 530.60ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 60.7MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37469.74ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 60.2MB in the beginning and 113.5MB in the end (delta: -53.3MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 113.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L53] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L54] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L56] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L57] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L58] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L60] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] unsigned short int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] signed short int last_1_WrapperStruct00_var_1_1 = 2; [L64] unsigned short int last_1_WrapperStruct00_var_1_6 = 128; [L65] signed long int last_1_WrapperStruct00_var_1_8 = 50; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_1 [L118] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_6 [L119] last_1_WrapperStruct00_var_1_6 = WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_8 [L120] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L98] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L114] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L131] RET updateVariables() [L132] CALL step() [L69] COND TRUE ! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L70] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L72] signed long int stepLocal_0 = 1 * (*(WrapperStruct00_var_1_4_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L73] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=-1169] [L73] EXPR (*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=-1169] [L73] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > stepLocal_0) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L76] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L79] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L81] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] unsigned short int stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L83] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=65536, stepLocal_2=0] [L83] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=65536, stepLocal_2=0] [L86] COND FALSE !((*(WrapperStruct00_var_1_14_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L93] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))) [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1 [L123] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L123] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) [L123] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L123] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))))) [L123] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) [L123] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) [L123] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L123] EXPR ((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L123] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L123] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123-L124] return ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 138 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 18, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3200 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 7525 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5688 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6957 IncrementalHoareTripleChecker+Invalid, 7248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1837 mSDtfsCounter, 6957 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 170 SyntacticMatches, 6 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=17, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 499 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 2087 NumberOfCodeBlocks, 2087 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 32478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 4730/4752 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:12:29,917 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-67.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 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:31,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:31,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:12:31,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:31,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:31,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:31,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:31,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:31,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:31,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:31,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:31,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:31,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:31,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:12:31,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:31,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:31,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:31,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:31,778 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 -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2025-03-17 06:12:31,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:31,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:31,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:32,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:32,000 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:32,001 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-67.i [2025-03-17 06:12:33,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1907cd50a/22749d4acce640a6a9cd13c6cc23fd11/FLAG19c52a24d [2025-03-17 06:12:33,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:33,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2025-03-17 06:12:33,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1907cd50a/22749d4acce640a6a9cd13c6cc23fd11/FLAG19c52a24d [2025-03-17 06:12:33,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1907cd50a/22749d4acce640a6a9cd13c6cc23fd11 [2025-03-17 06:12:33,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:33,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:33,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:33,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:33,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:33,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:33,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229c2ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33, skipping insertion in model container [2025-03-17 06:12:33,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:33,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:33,871 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-67.i[917,930] [2025-03-17 06:12:33,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:33,927 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:33,935 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-67.i[917,930] [2025-03-17 06:12:33,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:33,988 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:33,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33 WrapperNode [2025-03-17 06:12:33,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:33,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:33,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:33,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:33,995 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:12:33" (1/1) ... [2025-03-17 06:12:34,010 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:12:33" (1/1) ... [2025-03-17 06:12:34,045 INFO L138 Inliner]: procedures = 40, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2025-03-17 06:12:34,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:34,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:34,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:34,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:34,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,072 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-03-17 06:12:34,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:34,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:34,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:34,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:34,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (1/1) ... [2025-03-17 06:12:34,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:34,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:34,122 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:12:34,124 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:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:12:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:34,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:34,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:12:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:12:34,241 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:34,242 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:12:34,769 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~ite61#1;havoc property_#t~mem60#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~ite67#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~ite94#1;havoc property_#t~mem77#1;havoc property_#t~mem74#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite93#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem83#1;havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short95#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short98#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1; [2025-03-17 06:12:34,801 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-17 06:12:34,801 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:12:34,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:12:34,811 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:12:34,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:34 BoogieIcfgContainer [2025-03-17 06:12:34,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:12:34,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:12:34,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:12:34,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:12:34,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:33" (1/3) ... [2025-03-17 06:12:34,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340f757f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:34, skipping insertion in model container [2025-03-17 06:12:34,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:33" (2/3) ... [2025-03-17 06:12:34,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340f757f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:34, skipping insertion in model container [2025-03-17 06:12:34,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:34" (3/3) ... [2025-03-17 06:12:34,839 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2025-03-17 06:12:34,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:12:34,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-67.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:12:34,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:12:34,896 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;@36261c25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:12:34,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:12:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:12:34,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:34,909 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:34,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:34,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -50502400, now seen corresponding path program 1 times [2025-03-17 06:12:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079411069] [2025-03-17 06:12:34,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:34,922 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:12:34,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:34,924 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:12:34,926 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:12:35,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:12:35,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:12:35,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:35,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:35,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:12:35,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-17 06:12:35,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:35,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079411069] [2025-03-17 06:12:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079411069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:12:35,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535597722] [2025-03-17 06:12:35,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:35,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:12:35,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:35,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:12:35,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:35,251 INFO L87 Difference]: Start difference. First operand has 82 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 06:12:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:35,272 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2025-03-17 06:12:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:12:35,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-03-17 06:12:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:35,282 INFO L225 Difference]: With dead ends: 161 [2025-03-17 06:12:35,283 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 06:12:35,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:12:35,286 INFO L435 NwaCegarLoop]: 115 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, 115 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:12:35,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 06:12:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 06:12:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-03-17 06:12:35,315 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 99 [2025-03-17 06:12:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:35,315 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-03-17 06:12:35,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 06:12:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-03-17 06:12:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:12:35,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:35,320 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:35,330 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:12:35,525 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:12:35,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash -264384470, now seen corresponding path program 1 times [2025-03-17 06:12:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:35,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437280779] [2025-03-17 06:12:35,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:35,526 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:12:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:35,528 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:12:35,529 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:12:35,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:12:35,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:12:35,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:35,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:12:35,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:35,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:35,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437280779] [2025-03-17 06:12:35,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437280779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:35,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:35,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:12:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179395430] [2025-03-17 06:12:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:35,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:12:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:35,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:12:35,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:12:35,839 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:35,889 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2025-03-17 06:12:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:12:35,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 06:12:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:35,890 INFO L225 Difference]: With dead ends: 164 [2025-03-17 06:12:35,890 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 06:12:35,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:12:35,891 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:35,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 06:12:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-17 06:12:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-17 06:12:35,897 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 99 [2025-03-17 06:12:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:35,899 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-17 06:12:35,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-17 06:12:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:12:35,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:35,900 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:35,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:12:36,101 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:12:36,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:36,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2071838933, now seen corresponding path program 1 times [2025-03-17 06:12:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749354485] [2025-03-17 06:12:36,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:36,102 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:12:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:36,104 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:12:36,105 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:12:36,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:12:36,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:12:36,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:36,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:12:36,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:36,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:36,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749354485] [2025-03-17 06:12:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749354485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:12:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659261318] [2025-03-17 06:12:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:36,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:12:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:36,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:12:36,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:36,373 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:36,478 INFO L93 Difference]: Finished difference Result 170 states and 241 transitions. [2025-03-17 06:12:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 06:12:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:36,484 INFO L225 Difference]: With dead ends: 170 [2025-03-17 06:12:36,484 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 06:12:36,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:36,485 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:36,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:12:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 06:12:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-17 06:12:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2025-03-17 06:12:36,495 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 99 [2025-03-17 06:12:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:36,495 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2025-03-17 06:12:36,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2025-03-17 06:12:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:12:36,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:36,496 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:36,506 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:36,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:36,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1184335252, now seen corresponding path program 1 times [2025-03-17 06:12:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:36,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327344148] [2025-03-17 06:12:36,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:36,698 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:12:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:36,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:12:36,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:12:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:12:36,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:12:36,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:36,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:36,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:12:36,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 06:12:36,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:36,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327344148] [2025-03-17 06:12:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327344148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:12:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772523991] [2025-03-17 06:12:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:36,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:12:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:36,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:12:36,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:36,954 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:37,044 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2025-03-17 06:12:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 06:12:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:37,048 INFO L225 Difference]: With dead ends: 174 [2025-03-17 06:12:37,048 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 06:12:37,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:37,049 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:37,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 617 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:12:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 06:12:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-03-17 06:12:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 06:12:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-17 06:12:37,061 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 99 [2025-03-17 06:12:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:37,061 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-17 06:12:37,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 06:12:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-17 06:12:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:12:37,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:37,062 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:37,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:12:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:37,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:37,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1183411731, now seen corresponding path program 1 times [2025-03-17 06:12:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317225625] [2025-03-17 06:12:37,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:37,267 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:12:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:37,269 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:12:37,270 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:12:37,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:12:37,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:12:37,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:37,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:37,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 06:12:37,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:37,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:38,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:39,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:40,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:41,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:42,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:42,500 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 27 treesize of output 30 [2025-03-17 06:12:42,687 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 39 treesize of output 33 [2025-03-17 06:12:42,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2025-03-17 06:12:47,124 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 55 treesize of output 55 [2025-03-17 06:12:51,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:12:51,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 100 treesize of output 56 [2025-03-17 06:12:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:12:51,911 INFO L312 TraceCheckSpWp]: Computing backward predicates...