./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.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-2.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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:05:53,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:05:53,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:05:53,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:05:53,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:05:53,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:05:53,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:05:53,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:05:53,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:05:53,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:05:53,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:05:53,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:05:53,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:05:53,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:05:53,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:05:53,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:05:53,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:05:53,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:05:53,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:05:53,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:05:53,163 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2025-03-17 06:05:53,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:05:53,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:05:53,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:05:53,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:05:53,408 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:05:53,409 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-2.i [2025-03-17 06:05:54,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a3eaf00/3817dcf7b3224876b56b9e3d8f19741d/FLAG9c5b5ed1e [2025-03-17 06:05:54,825 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:05:54,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-17 06:05:54,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a3eaf00/3817dcf7b3224876b56b9e3d8f19741d/FLAG9c5b5ed1e [2025-03-17 06:05:55,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a3eaf00/3817dcf7b3224876b56b9e3d8f19741d [2025-03-17 06:05:55,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:05:55,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:05:55,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:05:55,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:05:55,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:05:55,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55, skipping insertion in model container [2025-03-17 06:05:55,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:05:55,276 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-2.i[916,929] [2025-03-17 06:05:55,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:05:55,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:05:55,368 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-2.i[916,929] [2025-03-17 06:05:55,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:05:55,432 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:05:55,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55 WrapperNode [2025-03-17 06:05:55,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:05:55,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:05:55,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:05:55,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:05:55,438 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:05:55" (1/1) ... [2025-03-17 06:05:55,453 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:05:55" (1/1) ... [2025-03-17 06:05:55,491 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-17 06:05:55,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:05:55,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:05:55,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:05:55,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:05:55,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,509 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:05:55,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:05:55,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:05:55,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:05:55,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:05:55,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (1/1) ... [2025-03-17 06:05:55,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:05:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:55,565 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:05:55,568 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:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:05:55,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:05:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:05:55,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:05:55,681 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:05:55,682 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:05:56,116 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem90#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite99#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite143#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short144#1; [2025-03-17 06:05:56,154 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-17 06:05:56,155 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:05:56,170 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:05:56,170 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:05:56,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:05:56 BoogieIcfgContainer [2025-03-17 06:05:56,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:05:56,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:05:56,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:05:56,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:05:56,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:05:55" (1/3) ... [2025-03-17 06:05:56,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1b4506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:05:56, skipping insertion in model container [2025-03-17 06:05:56,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:05:55" (2/3) ... [2025-03-17 06:05:56,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1b4506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:05:56, skipping insertion in model container [2025-03-17 06:05:56,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:05:56" (3/3) ... [2025-03-17 06:05:56,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-17 06:05:56,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:05:56,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-2.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:05:56,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:05:56,255 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;@493d51ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:05:56,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:05:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 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:05:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 06:05:56,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:56,268 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] [2025-03-17 06:05:56,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -814421724, now seen corresponding path program 1 times [2025-03-17 06:05:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397122359] [2025-03-17 06:05:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:56,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:05:56,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:05:56,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:56,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:56,574 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:05:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397122359] [2025-03-17 06:05:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397122359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:05:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011782866] [2025-03-17 06:05:56,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:56,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:05:56,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:56,583 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:05:56,586 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:05:56,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:05:56,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:05:56,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:56,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:05:56,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:56,791 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:05:56,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011782866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:05:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:05:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796343486] [2025-03-17 06:05:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:56,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:05:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:56,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:05:56,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:05:56,818 INFO L87 Difference]: Start difference. First operand has 98 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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:05:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:56,847 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2025-03-17 06:05:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:05:56,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 96 [2025-03-17 06:05:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:56,855 INFO L225 Difference]: With dead ends: 193 [2025-03-17 06:05:56,855 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 06:05:56,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:05:56,861 INFO L435 NwaCegarLoop]: 141 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, 141 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:05:56,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 06:05:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 06:05:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 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:05:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2025-03-17 06:05:56,893 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 96 [2025-03-17 06:05:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:56,893 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2025-03-17 06:05:56,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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:05:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2025-03-17 06:05:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 06:05:56,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:56,896 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] [2025-03-17 06:05:56,905 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:05:57,102 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:05:57,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:57,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1700675578, now seen corresponding path program 1 times [2025-03-17 06:05:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672530448] [2025-03-17 06:05:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:57,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:05:57,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:05:57,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:57,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:57,333 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:05:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672530448] [2025-03-17 06:05:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672530448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:57,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:57,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:05:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362399294] [2025-03-17 06:05:57,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:57,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:05:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:57,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:05:57,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:05:57,336 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:05:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:57,365 INFO L93 Difference]: Finished difference Result 192 states and 287 transitions. [2025-03-17 06:05:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:05:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 96 [2025-03-17 06:05:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:57,370 INFO L225 Difference]: With dead ends: 192 [2025-03-17 06:05:57,370 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 06:05:57,371 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:05:57,371 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:57,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 06:05:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 06:05:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 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:05:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2025-03-17 06:05:57,378 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 96 [2025-03-17 06:05:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2025-03-17 06:05:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:05:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2025-03-17 06:05:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 06:05:57,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:57,381 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] [2025-03-17 06:05:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:05:57,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2088733093, now seen corresponding path program 1 times [2025-03-17 06:05:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780618702] [2025-03-17 06:05:57,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:57,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:05:57,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:05:57,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:57,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 06:05:57,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:57,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780618702] [2025-03-17 06:05:57,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780618702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:05:57,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407033061] [2025-03-17 06:05:57,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:05:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:05:57,695 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:05:57,697 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:05:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:05:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:05:57,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:57,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:57,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:05:57,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:05:57,896 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:05:57,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:05:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407033061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:05:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:05:57,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288596693] [2025-03-17 06:05:57,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:57,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:05:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:57,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:05:57,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:57,899 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:05:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:57,944 INFO L93 Difference]: Finished difference Result 195 states and 290 transitions. [2025-03-17 06:05:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:05:57,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 96 [2025-03-17 06:05:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:57,946 INFO L225 Difference]: With dead ends: 195 [2025-03-17 06:05:57,946 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 06:05:57,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:05:57,947 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:57,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 06:05:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 06:05:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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:05:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2025-03-17 06:05:57,954 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 96 [2025-03-17 06:05:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:57,954 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2025-03-17 06:05:57,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:05:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2025-03-17 06:05:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:05:57,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:57,956 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:05:57,963 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:05:58,157 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,SelfDestructingSolverStorable2 [2025-03-17 06:05:58,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:58,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1370476724, now seen corresponding path program 1 times [2025-03-17 06:05:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:58,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-03-17 06:05:58,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:58,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:05:58,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:05:58,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:58,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:05:58,275 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:05:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:05:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-03-17 06:05:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697323397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:05:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:05:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:05:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025509834] [2025-03-17 06:05:58,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:05:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:05:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:05:58,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:05:58,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:05:58,279 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:05:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:05:58,323 INFO L93 Difference]: Finished difference Result 242 states and 358 transitions. [2025-03-17 06:05:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:05:58,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:05:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:05:58,325 INFO L225 Difference]: With dead ends: 242 [2025-03-17 06:05:58,325 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 06:05:58,328 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:05:58,329 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 60 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:05:58,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:05:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 06:05:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 117. [2025-03-17 06:05:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 103 states have internal predecessors, (150), 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:05:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2025-03-17 06:05:58,346 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 99 [2025-03-17 06:05:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:05:58,346 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2025-03-17 06:05:58,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:05:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2025-03-17 06:05:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:05:58,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:05:58,348 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:05:58,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:05:58,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:05:58,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:05:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1896069837, now seen corresponding path program 1 times [2025-03-17 06:05:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:05:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532794180] [2025-03-17 06:05:58,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:05:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:05:58,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:05:58,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:05:58,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:05:58,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:00,421 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:06:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532794180] [2025-03-17 06:06:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532794180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:00,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:06:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476257884] [2025-03-17 06:06:00,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:00,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:06:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:00,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:06:00,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:06:00,425 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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:06:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:01,078 INFO L93 Difference]: Finished difference Result 286 states and 423 transitions. [2025-03-17 06:06:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:06:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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 99 [2025-03-17 06:06:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:01,081 INFO L225 Difference]: With dead ends: 286 [2025-03-17 06:06:01,081 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 06:06:01,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:06:01,082 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:01,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 564 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:06:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 06:06:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2025-03-17 06:06:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 131 states have internal predecessors, (191), 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:06:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-17 06:06:01,099 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 99 [2025-03-17 06:06:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:01,099 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-17 06:06:01,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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:06:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-17 06:06:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 06:06:01,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:01,104 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:06:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:06:01,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1682975126, now seen corresponding path program 1 times [2025-03-17 06:06:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557614732] [2025-03-17 06:06:01,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:01,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 06:06:01,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 06:06:01,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:01,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:06:01,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587704472] [2025-03-17 06:06:01,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:01,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:01,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:01,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:06:01,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:06:01,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 06:06:01,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 06:06:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:01,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:01,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 06:06:01,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:01,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 61 treesize of output 60 [2025-03-17 06:06:01,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 78 [2025-03-17 06:06:01,621 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:06:01,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:01,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557614732] [2025-03-17 06:06:01,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:06:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587704472] [2025-03-17 06:06:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587704472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:01,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157549496] [2025-03-17 06:06:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:06:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:01,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:06:01,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:01,624 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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:06:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:02,492 INFO L93 Difference]: Finished difference Result 405 states and 602 transitions. [2025-03-17 06:06:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:06:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 101 [2025-03-17 06:06:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:02,494 INFO L225 Difference]: With dead ends: 405 [2025-03-17 06:06:02,494 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 06:06:02,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:06:02,495 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 94 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:02,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 351 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:06:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 06:06:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 215. [2025-03-17 06:06:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 188 states have (on average 1.4361702127659575) internal successors, (270), 188 states have internal predecessors, (270), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 06:06:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 318 transitions. [2025-03-17 06:06:02,521 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 318 transitions. Word has length 101 [2025-03-17 06:06:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:02,521 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 318 transitions. [2025-03-17 06:06:02,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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:06:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 318 transitions. [2025-03-17 06:06:02,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:06:02,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:02,522 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] [2025-03-17 06:06:02,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:06:02,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:02,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:02,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1465561174, now seen corresponding path program 1 times [2025-03-17 06:06:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:02,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106939786] [2025-03-17 06:06:02,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:02,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:02,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:06:02,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:06:02,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:02,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:04,063 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:06:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106939786] [2025-03-17 06:06:04,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106939786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:04,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:04,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:06:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815479497] [2025-03-17 06:06:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:04,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:06:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:04,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:06:04,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:06:04,065 INFO L87 Difference]: Start difference. First operand 215 states and 318 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 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:06:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:04,839 INFO L93 Difference]: Finished difference Result 541 states and 792 transitions. [2025-03-17 06:06:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:06:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 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 102 [2025-03-17 06:06:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:04,841 INFO L225 Difference]: With dead ends: 541 [2025-03-17 06:06:04,841 INFO L226 Difference]: Without dead ends: 397 [2025-03-17 06:06:04,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:06:04,843 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 675 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:04,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 417 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:06:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-17 06:06:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 346. [2025-03-17 06:06:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 313 states have (on average 1.4408945686900958) internal successors, (451), 314 states have internal predecessors, (451), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 507 transitions. [2025-03-17 06:06:04,868 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 507 transitions. Word has length 102 [2025-03-17 06:06:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:04,869 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 507 transitions. [2025-03-17 06:06:04,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 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:06:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 507 transitions. [2025-03-17 06:06:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:06:04,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:04,870 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] [2025-03-17 06:06:04,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:06:04,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:04,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1032454763, now seen corresponding path program 1 times [2025-03-17 06:06:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:04,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712600728] [2025-03-17 06:06:04,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:04,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:06:04,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:06:04,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:04,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:06,786 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:06:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712600728] [2025-03-17 06:06:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712600728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:06,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:06:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452465294] [2025-03-17 06:06:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:06:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:06,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:06:06,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:06:06,788 INFO L87 Difference]: Start difference. First operand 346 states and 507 transitions. Second operand has 13 states, 9 states have (on average 5.0) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 06:06:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:07,683 INFO L93 Difference]: Finished difference Result 582 states and 854 transitions. [2025-03-17 06:06:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.0) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 102 [2025-03-17 06:06:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:07,686 INFO L225 Difference]: With dead ends: 582 [2025-03-17 06:06:07,686 INFO L226 Difference]: Without dead ends: 340 [2025-03-17 06:06:07,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:06:07,689 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 271 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:07,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 581 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:06:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-17 06:06:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-17 06:06:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 306 states have (on average 1.4313725490196079) internal successors, (438), 307 states have internal predecessors, (438), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 494 transitions. [2025-03-17 06:06:07,719 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 494 transitions. Word has length 102 [2025-03-17 06:06:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:07,719 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 494 transitions. [2025-03-17 06:06:07,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.0) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 06:06:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2025-03-17 06:06:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:06:07,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:07,721 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] [2025-03-17 06:06:07,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:06:07,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1254210261, now seen corresponding path program 1 times [2025-03-17 06:06:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791006119] [2025-03-17 06:06:07,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:07,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:06:07,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:06:07,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:07,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:08,880 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:06:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791006119] [2025-03-17 06:06:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791006119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:08,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:08,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:06:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980768402] [2025-03-17 06:06:08,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:08,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 06:06:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:08,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 06:06:08,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:06:08,882 INFO L87 Difference]: Start difference. First operand 340 states and 494 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 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:06:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:09,406 INFO L93 Difference]: Finished difference Result 634 states and 921 transitions. [2025-03-17 06:06:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:06:09,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 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 102 [2025-03-17 06:06:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:09,408 INFO L225 Difference]: With dead ends: 634 [2025-03-17 06:06:09,408 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 06:06:09,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:06:09,409 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 215 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:09,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 278 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:06:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 06:06:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 350. [2025-03-17 06:06:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 316 states have (on average 1.4240506329113924) internal successors, (450), 317 states have internal predecessors, (450), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 506 transitions. [2025-03-17 06:06:09,435 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 506 transitions. Word has length 102 [2025-03-17 06:06:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:09,435 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 506 transitions. [2025-03-17 06:06:09,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 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:06:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 506 transitions. [2025-03-17 06:06:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:06:09,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:09,436 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] [2025-03-17 06:06:09,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:06:09,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:09,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1243805676, now seen corresponding path program 1 times [2025-03-17 06:06:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:09,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550872112] [2025-03-17 06:06:09,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:09,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:06:09,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:06:09,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:09,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:10,375 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:06:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550872112] [2025-03-17 06:06:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550872112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:06:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296598057] [2025-03-17 06:06:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:10,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:06:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:10,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:06:10,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:06:10,377 INFO L87 Difference]: Start difference. First operand 350 states and 506 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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:06:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:11,168 INFO L93 Difference]: Finished difference Result 812 states and 1181 transitions. [2025-03-17 06:06:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:06:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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 102 [2025-03-17 06:06:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:11,172 INFO L225 Difference]: With dead ends: 812 [2025-03-17 06:06:11,172 INFO L226 Difference]: Without dead ends: 574 [2025-03-17 06:06:11,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:06:11,174 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 325 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:11,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 911 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:06:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-17 06:06:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 476. [2025-03-17 06:06:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 442 states have (on average 1.4434389140271493) internal successors, (638), 443 states have internal predecessors, (638), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 694 transitions. [2025-03-17 06:06:11,210 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 694 transitions. Word has length 102 [2025-03-17 06:06:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:11,211 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 694 transitions. [2025-03-17 06:06:11,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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:06:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 694 transitions. [2025-03-17 06:06:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:06:11,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:11,212 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:06:11,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:06:11,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:11,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1531619593, now seen corresponding path program 1 times [2025-03-17 06:06:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462527859] [2025-03-17 06:06:11,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:11,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:06:11,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:06:11,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:11,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:11,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:06:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462527859] [2025-03-17 06:06:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462527859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:11,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:11,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:06:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938465194] [2025-03-17 06:06:11,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:11,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:06:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:11,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:06:11,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:06:11,626 INFO L87 Difference]: Start difference. First operand 476 states and 694 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:06:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:11,973 INFO L93 Difference]: Finished difference Result 886 states and 1297 transitions. [2025-03-17 06:06:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:06:11,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:06:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:11,976 INFO L225 Difference]: With dead ends: 886 [2025-03-17 06:06:11,976 INFO L226 Difference]: Without dead ends: 578 [2025-03-17 06:06:11,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:06:11,977 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 193 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:11,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 373 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:06:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-17 06:06:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 488. [2025-03-17 06:06:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 454 states have (on average 1.449339207048458) internal successors, (658), 455 states have internal predecessors, (658), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 714 transitions. [2025-03-17 06:06:12,001 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 714 transitions. Word has length 104 [2025-03-17 06:06:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:12,001 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 714 transitions. [2025-03-17 06:06:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:06:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 714 transitions. [2025-03-17 06:06:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:06:12,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:12,003 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:06:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:06:12,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash -265331766, now seen corresponding path program 1 times [2025-03-17 06:06:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081776405] [2025-03-17 06:06:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:12,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:06:12,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:06:12,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:12,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:13,740 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:06:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081776405] [2025-03-17 06:06:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081776405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:13,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:06:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589755844] [2025-03-17 06:06:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:13,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:06:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:13,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:06:13,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:06:13,741 INFO L87 Difference]: Start difference. First operand 488 states and 714 transitions. Second operand has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:14,678 INFO L93 Difference]: Finished difference Result 854 states and 1255 transitions. [2025-03-17 06:06:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2025-03-17 06:06:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:14,681 INFO L225 Difference]: With dead ends: 854 [2025-03-17 06:06:14,681 INFO L226 Difference]: Without dead ends: 534 [2025-03-17 06:06:14,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:06:14,682 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 278 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:14,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 619 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:06:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-17 06:06:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 488. [2025-03-17 06:06:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 454 states have (on average 1.4449339207048457) internal successors, (656), 455 states have internal predecessors, (656), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 712 transitions. [2025-03-17 06:06:14,712 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 712 transitions. Word has length 104 [2025-03-17 06:06:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:14,713 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 712 transitions. [2025-03-17 06:06:14,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 712 transitions. [2025-03-17 06:06:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:06:14,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:14,716 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:06:14,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:06:14,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:14,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash 772884201, now seen corresponding path program 1 times [2025-03-17 06:06:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327525673] [2025-03-17 06:06:14,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:14,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:06:14,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:06:14,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:16,510 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:06:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327525673] [2025-03-17 06:06:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327525673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:06:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215293900] [2025-03-17 06:06:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:06:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:16,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:06:16,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:06:16,512 INFO L87 Difference]: Start difference. First operand 488 states and 712 transitions. Second operand has 13 states, 10 states have (on average 4.7) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 06:06:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:17,393 INFO L93 Difference]: Finished difference Result 858 states and 1264 transitions. [2025-03-17 06:06:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:06:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.7) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2025-03-17 06:06:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:17,396 INFO L225 Difference]: With dead ends: 858 [2025-03-17 06:06:17,396 INFO L226 Difference]: Without dead ends: 534 [2025-03-17 06:06:17,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:06:17,398 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 193 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:17,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 456 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:06:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-17 06:06:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 522. [2025-03-17 06:06:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 488 states have (on average 1.4426229508196722) internal successors, (704), 489 states have internal predecessors, (704), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 760 transitions. [2025-03-17 06:06:17,424 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 760 transitions. Word has length 104 [2025-03-17 06:06:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:17,424 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 760 transitions. [2025-03-17 06:06:17,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.7) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 06:06:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 760 transitions. [2025-03-17 06:06:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 06:06:17,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:17,425 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:06:17,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:06:17,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:17,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:17,426 INFO L85 PathProgramCache]: Analyzing trace with hash 984235114, now seen corresponding path program 1 times [2025-03-17 06:06:17,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:17,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261844183] [2025-03-17 06:06:17,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:17,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:17,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 06:06:17,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 06:06:17,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:19,398 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:06:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261844183] [2025-03-17 06:06:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261844183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:19,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:19,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:06:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086623297] [2025-03-17 06:06:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:19,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:06:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:19,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:06:19,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:06:19,399 INFO L87 Difference]: Start difference. First operand 522 states and 760 transitions. Second operand has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:20,422 INFO L93 Difference]: Finished difference Result 905 states and 1323 transitions. [2025-03-17 06:06:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2025-03-17 06:06:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:20,426 INFO L225 Difference]: With dead ends: 905 [2025-03-17 06:06:20,427 INFO L226 Difference]: Without dead ends: 568 [2025-03-17 06:06:20,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:06:20,428 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 289 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:20,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 754 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:06:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-17 06:06:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 522. [2025-03-17 06:06:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 488 states have (on average 1.4385245901639345) internal successors, (702), 489 states have internal predecessors, (702), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 758 transitions. [2025-03-17 06:06:20,455 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 758 transitions. Word has length 104 [2025-03-17 06:06:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 758 transitions. [2025-03-17 06:06:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 758 transitions. [2025-03-17 06:06:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 06:06:20,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:20,457 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] [2025-03-17 06:06:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:06:20,457 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -999630766, now seen corresponding path program 1 times [2025-03-17 06:06:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597383573] [2025-03-17 06:06:20,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:20,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 06:06:20,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 06:06:20,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:20,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:21,682 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:06:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597383573] [2025-03-17 06:06:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597383573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:06:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417499217] [2025-03-17 06:06:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:21,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:06:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:21,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:06:21,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:06:21,683 INFO L87 Difference]: Start difference. First operand 522 states and 758 transitions. Second operand has 12 states, 10 states have (on average 4.8) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:22,295 INFO L93 Difference]: Finished difference Result 863 states and 1260 transitions. [2025-03-17 06:06:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.8) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-03-17 06:06:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:22,297 INFO L225 Difference]: With dead ends: 863 [2025-03-17 06:06:22,297 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 06:06:22,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:06:22,298 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:22,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 428 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:06:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 06:06:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-17 06:06:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 488 states have (on average 1.430327868852459) internal successors, (698), 489 states have internal predecessors, (698), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 754 transitions. [2025-03-17 06:06:22,330 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 754 transitions. Word has length 105 [2025-03-17 06:06:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:22,330 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 754 transitions. [2025-03-17 06:06:22,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.8) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2025-03-17 06:06:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 06:06:22,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:22,332 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] [2025-03-17 06:06:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:06:22,332 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1066637519, now seen corresponding path program 1 times [2025-03-17 06:06:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288626246] [2025-03-17 06:06:22,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 06:06:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 06:06:22,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:22,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:23,703 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:06:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288626246] [2025-03-17 06:06:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288626246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:23,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:23,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:06:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71205095] [2025-03-17 06:06:23,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:23,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:06:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:23,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:06:23,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:06:23,706 INFO L87 Difference]: Start difference. First operand 522 states and 754 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 14 states have internal predecessors, (48), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 06:06:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:24,454 INFO L93 Difference]: Finished difference Result 911 states and 1318 transitions. [2025-03-17 06:06:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 14 states have internal predecessors, (48), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 105 [2025-03-17 06:06:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:24,458 INFO L225 Difference]: With dead ends: 911 [2025-03-17 06:06:24,458 INFO L226 Difference]: Without dead ends: 574 [2025-03-17 06:06:24,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:06:24,459 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 193 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:24,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 569 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:06:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-17 06:06:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 522. [2025-03-17 06:06:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 488 states have (on average 1.430327868852459) internal successors, (698), 489 states have internal predecessors, (698), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 754 transitions. [2025-03-17 06:06:24,487 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 754 transitions. Word has length 105 [2025-03-17 06:06:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:24,488 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 754 transitions. [2025-03-17 06:06:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 14 states have internal predecessors, (48), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 06:06:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2025-03-17 06:06:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 06:06:24,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:24,490 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:06:24,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 06:06:24,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -604538680, now seen corresponding path program 1 times [2025-03-17 06:06:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608232401] [2025-03-17 06:06:24,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:24,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 06:06:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 06:06:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:25,560 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:06:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608232401] [2025-03-17 06:06:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608232401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:25,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:06:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095359310] [2025-03-17 06:06:25,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:25,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:06:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:25,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:06:25,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:06:25,562 INFO L87 Difference]: Start difference. First operand 522 states and 754 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 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:06:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:26,844 INFO L93 Difference]: Finished difference Result 1068 states and 1541 transitions. [2025-03-17 06:06:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:06:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 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 106 [2025-03-17 06:06:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:26,847 INFO L225 Difference]: With dead ends: 1068 [2025-03-17 06:06:26,847 INFO L226 Difference]: Without dead ends: 731 [2025-03-17 06:06:26,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-03-17 06:06:26,848 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 266 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:26,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1114 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:06:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-17 06:06:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 625. [2025-03-17 06:06:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 591 states have (on average 1.4348561759729273) internal successors, (848), 592 states have internal predecessors, (848), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 904 transitions. [2025-03-17 06:06:26,875 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 904 transitions. Word has length 106 [2025-03-17 06:06:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:26,875 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 904 transitions. [2025-03-17 06:06:26,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 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:06:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 904 transitions. [2025-03-17 06:06:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:06:26,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:26,876 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:06:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:06:26,876 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1250824332, now seen corresponding path program 1 times [2025-03-17 06:06:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439790778] [2025-03-17 06:06:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:26,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:26,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:26,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:26,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:29,244 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:06:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439790778] [2025-03-17 06:06:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439790778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 06:06:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594434255] [2025-03-17 06:06:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:29,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:06:29,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:29,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:06:29,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:06:29,247 INFO L87 Difference]: Start difference. First operand 625 states and 904 transitions. Second operand has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:30,337 INFO L93 Difference]: Finished difference Result 1074 states and 1560 transitions. [2025-03-17 06:06:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-03-17 06:06:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:30,346 INFO L225 Difference]: With dead ends: 1074 [2025-03-17 06:06:30,346 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 06:06:30,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:06:30,347 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 317 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:30,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 631 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:06:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 06:06:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 625. [2025-03-17 06:06:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 591 states have (on average 1.4314720812182742) internal successors, (846), 592 states have internal predecessors, (846), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 902 transitions. [2025-03-17 06:06:30,372 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 902 transitions. Word has length 107 [2025-03-17 06:06:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:30,373 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 902 transitions. [2025-03-17 06:06:30,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 902 transitions. [2025-03-17 06:06:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:06:30,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:30,374 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:06:30,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 06:06:30,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:30,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 953788598, now seen corresponding path program 1 times [2025-03-17 06:06:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:30,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088964823] [2025-03-17 06:06:30,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:30,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:30,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:30,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:30,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:30,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:32,655 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:06:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088964823] [2025-03-17 06:06:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088964823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:06:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478686068] [2025-03-17 06:06:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:06:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:32,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:06:32,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:06:32,657 INFO L87 Difference]: Start difference. First operand 625 states and 902 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:33,431 INFO L93 Difference]: Finished difference Result 1018 states and 1478 transitions. [2025-03-17 06:06:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:06:33,431 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-03-17 06:06:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:33,433 INFO L225 Difference]: With dead ends: 1018 [2025-03-17 06:06:33,433 INFO L226 Difference]: Without dead ends: 617 [2025-03-17 06:06:33,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:06:33,435 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 387 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:33,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 479 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:06:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-17 06:06:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2025-03-17 06:06:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 581 states have (on average 1.4182444061962134) internal successors, (824), 582 states have internal predecessors, (824), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 880 transitions. [2025-03-17 06:06:33,459 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 880 transitions. Word has length 107 [2025-03-17 06:06:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 880 transitions. [2025-03-17 06:06:33,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 06:06:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 880 transitions. [2025-03-17 06:06:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:06:33,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:33,461 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:06:33,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:06:33,461 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1662061754, now seen corresponding path program 1 times [2025-03-17 06:06:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304293671] [2025-03-17 06:06:33,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:33,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:33,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:36,170 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:06:36,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304293671] [2025-03-17 06:06:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304293671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 06:06:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801541899] [2025-03-17 06:06:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:06:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:36,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:06:36,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:06:36,172 INFO L87 Difference]: Start difference. First operand 615 states and 880 transitions. Second operand has 18 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 06:06:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:37,686 INFO L93 Difference]: Finished difference Result 1044 states and 1500 transitions. [2025-03-17 06:06:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:06:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 107 [2025-03-17 06:06:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:37,689 INFO L225 Difference]: With dead ends: 1044 [2025-03-17 06:06:37,689 INFO L226 Difference]: Without dead ends: 653 [2025-03-17 06:06:37,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:06:37,691 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 252 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:37,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1044 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:06:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-17 06:06:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 615. [2025-03-17 06:06:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 581 states have (on average 1.4113597246127367) internal successors, (820), 582 states have internal predecessors, (820), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:06:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 876 transitions. [2025-03-17 06:06:37,717 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 876 transitions. Word has length 107 [2025-03-17 06:06:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:37,717 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 876 transitions. [2025-03-17 06:06:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 18 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 06:06:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 876 transitions. [2025-03-17 06:06:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:06:37,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:37,718 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:06:37,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:06:37,718 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:37,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1219804525, now seen corresponding path program 1 times [2025-03-17 06:06:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:37,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550350490] [2025-03-17 06:06:37,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:37,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:40,225 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:06:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:06:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550350490] [2025-03-17 06:06:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550350490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:06:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238677159] [2025-03-17 06:06:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:06:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:06:40,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:06:40,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:06:40,226 INFO L87 Difference]: Start difference. First operand 615 states and 876 transitions. Second operand has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 06:06:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:41,545 INFO L93 Difference]: Finished difference Result 1040 states and 1479 transitions. [2025-03-17 06:06:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:06:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-03-17 06:06:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:41,548 INFO L225 Difference]: With dead ends: 1040 [2025-03-17 06:06:41,548 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 06:06:41,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:06:41,549 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 529 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:41,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 698 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:06:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 06:06:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 621. [2025-03-17 06:06:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 584 states have (on average 1.3972602739726028) internal successors, (816), 586 states have internal predecessors, (816), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 06:06:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 876 transitions. [2025-03-17 06:06:41,577 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 876 transitions. Word has length 107 [2025-03-17 06:06:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:41,577 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 876 transitions. [2025-03-17 06:06:41,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 06:06:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 876 transitions. [2025-03-17 06:06:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 06:06:41,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:41,580 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:06:41,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:06:41,580 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:41,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1025202311, now seen corresponding path program 1 times [2025-03-17 06:06:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:06:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244538238] [2025-03-17 06:06:41,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:06:41,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:41,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:41,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:41,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:06:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582838603] [2025-03-17 06:06:41,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:41,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:41,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:41,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:06:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:06:41,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:42,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:42,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:42,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:06:42,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:06:42,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 06:06:42,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 06:06:42,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:42,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:06:42,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:06:42,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:06:42,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:06:42,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:06:42,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:06:42,751 INFO L422 BasicCegarLoop]: Path program histogram: [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:06:42,860 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:06:42,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:06:42 BoogieIcfgContainer [2025-03-17 06:06:42,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:06:42,864 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:06:42,864 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:06:42,864 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:06:42,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:05:56" (3/4) ... [2025-03-17 06:06:42,866 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:06:42,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:06:42,868 INFO L158 Benchmark]: Toolchain (without parser) took 47710.22ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 104.5MB in the beginning and 593.0MB in the end (delta: -488.5MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2025-03-17 06:06:42,868 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:06:42,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.07ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:06:42,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.15ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:06:42,869 INFO L158 Benchmark]: Boogie Preprocessor took 40.87ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:06:42,869 INFO L158 Benchmark]: IcfgBuilder took 636.91ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 45.3MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:06:42,871 INFO L158 Benchmark]: TraceAbstraction took 46689.50ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 44.2MB in the beginning and 593.2MB in the end (delta: -549.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2025-03-17 06:06:42,871 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 721.4MB. Free memory was 593.2MB in the beginning and 593.0MB in the end (delta: 230.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:06:42,872 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.07ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.15ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.87ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 636.91ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 45.3MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 46689.50ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 44.2MB in the beginning and 593.2MB in the end (delta: -549.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 721.4MB. Free memory was 593.2MB in the beginning and 593.0MB in the end (delta: 230.8kB). Peak memory consumption was 8.4MB. 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 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L49] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L50] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L51] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L52] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L53] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L54] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L55] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L56] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L57] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L58] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_1 [L110] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_9 [L111] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_12 [L105] 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:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] 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:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] 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:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] 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:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L122] RET updateVariables() [L123] CALL step() [L62] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) [L65] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L65] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L65] COND FALSE !((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L76] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L78] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 [L114] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114-L115] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 159 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.5s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5056 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5026 mSDsluCounter, 11364 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9133 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13586 IncrementalHoareTripleChecker+Invalid, 13916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 2231 mSDtfsCounter, 13586 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 437 SyntacticMatches, 7 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=17, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 767 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2324 ConstructedInterpolants, 0 QuantifiedInterpolants, 33073 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1207 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 6017/6072 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:06:43,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-2.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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:06:44,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:06:44,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:06:44,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:06:44,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:06:45,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:06:45,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:06:45,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:06:45,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:06:45,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:06:45,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:06:45,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:06:45,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:06:45,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:06:45,012 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:06:45,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:06:45,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:06:45,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:06:45,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:45,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:06:45,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:06:45,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:06:45,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:06:45,016 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2025-03-17 06:06:45,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:06:45,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:06:45,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:06:45,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:06:45,302 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:06:45,303 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-2.i [2025-03-17 06:06:46,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c5cf971/a5d3a3accbea47f9a815c6322c1b7ef8/FLAG2ea5fd569 [2025-03-17 06:06:46,742 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:06:46,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-17 06:06:46,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c5cf971/a5d3a3accbea47f9a815c6322c1b7ef8/FLAG2ea5fd569 [2025-03-17 06:06:46,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c5cf971/a5d3a3accbea47f9a815c6322c1b7ef8 [2025-03-17 06:06:46,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:06:46,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:06:46,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:46,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:06:46,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:06:46,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:46" (1/1) ... [2025-03-17 06:06:46,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f4d520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:46, skipping insertion in model container [2025-03-17 06:06:46,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:06:46" (1/1) ... [2025-03-17 06:06:46,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:06:46,916 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-2.i[916,929] [2025-03-17 06:06:46,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:46,998 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:06:47,007 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-2.i[916,929] [2025-03-17 06:06:47,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:06:47,074 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:06:47,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47 WrapperNode [2025-03-17 06:06:47,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:06:47,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:47,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:06:47,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:06:47,080 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:06:47" (1/1) ... [2025-03-17 06:06:47,096 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:06:47" (1/1) ... [2025-03-17 06:06:47,140 INFO L138 Inliner]: procedures = 34, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2025-03-17 06:06:47,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:06:47,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:06:47,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:06:47,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:06:47,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,190 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 26 writes are split as follows [0, 26]. [2025-03-17 06:06:47,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:06:47,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:06:47,233 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:06:47,233 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:06:47,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (1/1) ... [2025-03-17 06:06:47,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:06:47,267 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:06:47,270 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:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:06:47,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:06:47,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:06:47,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:06:47,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:06:47,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:06:47,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:06:47,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:06:47,983 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite98#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite124#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite121#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-17 06:06:48,049 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-17 06:06:48,050 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:06:48,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:06:48,060 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:06:48,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:48 BoogieIcfgContainer [2025-03-17 06:06:48,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:06:48,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:06:48,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:06:48,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:06:48,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:06:46" (1/3) ... [2025-03-17 06:06:48,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb7f884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:48, skipping insertion in model container [2025-03-17 06:06:48,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:06:47" (2/3) ... [2025-03-17 06:06:48,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb7f884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:06:48, skipping insertion in model container [2025-03-17 06:06:48,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:06:48" (3/3) ... [2025-03-17 06:06:48,069 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-17 06:06:48,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:06:48,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-2.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:06:48,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:06:48,132 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;@7d4648ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:06:48,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:06:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 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:06:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 06:06:48,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:48,145 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] [2025-03-17 06:06:48,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1217131305, now seen corresponding path program 1 times [2025-03-17 06:06:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413843461] [2025-03-17 06:06:48,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:48,157 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:06:48,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:48,159 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:06:48,160 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:06:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:06:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:06:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:48,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:06:48,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:48,442 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:06:48,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:48,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413843461] [2025-03-17 06:06:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413843461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:06:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703390948] [2025-03-17 06:06:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:48,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:06:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:48,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:06:48,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:06:48,465 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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:06:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:48,483 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2025-03-17 06:06:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:06:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 96 [2025-03-17 06:06:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:48,491 INFO L225 Difference]: With dead ends: 185 [2025-03-17 06:06:48,491 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 06:06:48,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:06:48,495 INFO L435 NwaCegarLoop]: 137 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, 137 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:06:48,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 06:06:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 06:06:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 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:06:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2025-03-17 06:06:48,528 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 96 [2025-03-17 06:06:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:48,528 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2025-03-17 06:06:48,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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:06:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2025-03-17 06:06:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 06:06:48,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:48,533 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] [2025-03-17 06:06:48,542 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:06:48,733 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:06:48,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1297965997, now seen corresponding path program 1 times [2025-03-17 06:06:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25885223] [2025-03-17 06:06:48,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:48,735 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:06:48,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:48,739 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:06:48,740 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:06:48,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 06:06:48,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 06:06:48,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:48,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:48,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:06:48,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:49,011 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:06:49,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:49,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25885223] [2025-03-17 06:06:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25885223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:06:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240500757] [2025-03-17 06:06:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:49,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:06:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:49,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:06:49,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:49,015 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:06:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:49,059 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2025-03-17 06:06:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:06:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 96 [2025-03-17 06:06:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:49,062 INFO L225 Difference]: With dead ends: 185 [2025-03-17 06:06:49,062 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 06:06:49,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 93 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:06:49,063 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:49,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:06:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 06:06:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 06:06:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 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:06:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2025-03-17 06:06:49,070 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 96 [2025-03-17 06:06:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:49,074 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2025-03-17 06:06:49,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:06:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2025-03-17 06:06:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:06:49,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:49,080 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:06:49,087 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:06:49,284 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:06:49,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -291103814, now seen corresponding path program 1 times [2025-03-17 06:06:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094724451] [2025-03-17 06:06:49,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:49,285 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:06:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:49,288 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:06:49,288 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:06:49,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:06:49,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:06:49,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:49,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:49,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 06:06:49,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:49,663 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:06:49,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:49,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094724451] [2025-03-17 06:06:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094724451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777439224] [2025-03-17 06:06:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:49,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:06:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:49,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:06:49,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:06:49,665 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:06:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:49,794 INFO L93 Difference]: Finished difference Result 227 states and 337 transitions. [2025-03-17 06:06:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:06:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:06:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:49,798 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:06:49,798 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 06:06:49,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:06:49,799 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 54 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:49,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:06:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 06:06:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2025-03-17 06:06:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 95 states have internal predecessors, (139), 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:06:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2025-03-17 06:06:49,813 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 99 [2025-03-17 06:06:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:49,814 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2025-03-17 06:06:49,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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:06:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2025-03-17 06:06:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 06:06:49,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:49,817 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:06:49,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 06:06:50,018 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:06:50,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:50,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1561649499, now seen corresponding path program 1 times [2025-03-17 06:06:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:50,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972032089] [2025-03-17 06:06:50,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:50,020 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:06:50,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:50,023 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:06:50,024 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:06:50,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 06:06:50,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 06:06:50,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:50,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:50,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:06:50,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:50,330 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 60 treesize of output 59 [2025-03-17 06:06:50,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 92 [2025-03-17 06:06:50,751 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:06:50,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:06:50,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:06:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972032089] [2025-03-17 06:06:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972032089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:06:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:06:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:06:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416771233] [2025-03-17 06:06:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:06:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:06:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:06:50,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:06:50,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:06:50,753 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 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:06:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:06:51,858 INFO L93 Difference]: Finished difference Result 313 states and 465 transitions. [2025-03-17 06:06:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:06:51,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 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:06:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:06:51,861 INFO L225 Difference]: With dead ends: 313 [2025-03-17 06:06:51,861 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 06:06:51,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:06:51,864 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 87 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:06:51,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 327 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 06:06:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 06:06:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173. [2025-03-17 06:06:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 145 states have (on average 1.4275862068965517) internal successors, (207), 145 states have internal predecessors, (207), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 06:06:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2025-03-17 06:06:51,880 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 99 [2025-03-17 06:06:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:06:51,880 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2025-03-17 06:06:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 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:06:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2025-03-17 06:06:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 06:06:51,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:06:51,882 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] [2025-03-17 06:06:51,890 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:06:52,082 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:06:52,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:06:52,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:06:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash -666624128, now seen corresponding path program 1 times [2025-03-17 06:06:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:06:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126613346] [2025-03-17 06:06:52,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:06:52,084 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:06:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:06:52,086 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:06:52,087 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:06:52,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 06:06:52,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 06:06:52,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:06:52,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:06:52,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 06:06:52,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:06:53,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:06:54,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-17 06:06:54,728 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 30 treesize of output 32 [2025-03-17 06:06:55,396 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 41 treesize of output 35 [2025-03-17 06:06:55,750 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 41 treesize of output 35 [2025-03-17 06:06:56,270 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 44 [2025-03-17 06:06:56,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2025-03-17 06:06:56,594 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 65 treesize of output 61 [2025-03-17 06:06:56,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:06:56,769 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 87 treesize of output 47 [2025-03-17 06:06:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 59 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 06:06:56,779 INFO L312 TraceCheckSpWp]: Computing backward predicates...