./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:47:33,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:47:33,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:47:33,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:47:33,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:47:33,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:47:33,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:47:33,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:47:33,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:47:33,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:47:33,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:47:33,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:47:33,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:47:33,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:33,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:47:33,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:47:33,672 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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2025-03-04 01:47:33,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:47:33,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:47:33,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:47:33,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:47:33,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:47:33,930 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-15.i [2025-03-04 01:47:35,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e71d2c46/6234a37855a341edb54e1b3456964b1e/FLAG14f5a5f28 [2025-03-04 01:47:35,349 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:47:35,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2025-03-04 01:47:35,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e71d2c46/6234a37855a341edb54e1b3456964b1e/FLAG14f5a5f28 [2025-03-04 01:47:35,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e71d2c46/6234a37855a341edb54e1b3456964b1e [2025-03-04 01:47:35,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:47:35,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:47:35,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:35,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:47:35,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:47:35,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35, skipping insertion in model container [2025-03-04 01:47:35,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:47:35,509 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-15.i[917,930] [2025-03-04 01:47:35,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:35,581 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:47:35,590 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-15.i[917,930] [2025-03-04 01:47:35,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:47:35,643 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:47:35,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35 WrapperNode [2025-03-04 01:47:35,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:47:35,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:35,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:47:35,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:47:35,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,689 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2025-03-04 01:47:35,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:47:35,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:47:35,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:47:35,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:47:35,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,706 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:47:35,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:47:35,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:47:35,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:47:35,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:47:35,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (1/1) ... [2025-03-04 01:47:35,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:47:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:35,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:47:35,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:47:35,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:47:35,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:47:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:47:35,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:47:35,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:47:35,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:47:36,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-03-04 01:47:36,267 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-04 01:47:36,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:47:36,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:47:36,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:47:36,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:36 BoogieIcfgContainer [2025-03-04 01:47:36,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:47:36,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:47:36,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:47:36,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:47:36,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:47:35" (1/3) ... [2025-03-04 01:47:36,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38da0a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:36, skipping insertion in model container [2025-03-04 01:47:36,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:47:35" (2/3) ... [2025-03-04 01:47:36,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38da0a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:47:36, skipping insertion in model container [2025-03-04 01:47:36,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:36" (3/3) ... [2025-03-04 01:47:36,289 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2025-03-04 01:47:36,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:47:36,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:47:36,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:47:36,351 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;@6c4cc20a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:47:36,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:47:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 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-04 01:47:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:47:36,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:36,368 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:36,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:36,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1886355795, now seen corresponding path program 1 times [2025-03-04 01:47:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149089434] [2025-03-04 01:47:36,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:36,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:47:36,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:47:36,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:36,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:36,701 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-04 01:47:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149089434] [2025-03-04 01:47:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149089434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:47:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90996315] [2025-03-04 01:47:36,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:47:36,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:47:36,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:47:36,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:47:36,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:47:36,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:47:36,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:36,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:47:36,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:36,920 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-04 01:47:36,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90996315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:36,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:47:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:47:36,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311146952] [2025-03-04 01:47:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:36,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:47:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:36,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:47:36,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:36,942 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-04 01:47:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:36,959 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-03-04 01:47:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:47:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 115 [2025-03-04 01:47:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:36,965 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:47:36,965 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:47:36,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:47:36,969 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:36,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:47:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:47:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 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-04 01:47:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:47:36,996 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-03-04 01:47:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:36,996 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:47:36,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-04 01:47:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:47:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:47:36,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:36,998 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:37,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:47:37,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:47:37,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:37,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1474559676, now seen corresponding path program 1 times [2025-03-04 01:47:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:37,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891384178] [2025-03-04 01:47:37,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:37,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:47:37,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:47:37,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:37,571 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-04 01:47:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891384178] [2025-03-04 01:47:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891384178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:37,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:47:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530953225] [2025-03-04 01:47:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:37,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:47:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:37,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:47:37,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:47:37,574 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-04 01:47:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:37,600 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2025-03-04 01:47:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:47:37,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2025-03-04 01:47:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:37,604 INFO L225 Difference]: With dead ends: 213 [2025-03-04 01:47:37,604 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:47:37,605 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-04 01:47:37,606 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:37,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:47:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:47:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:47:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 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-04 01:47:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-03-04 01:47:37,618 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 115 [2025-03-04 01:47:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:37,619 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-03-04 01:47:37,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-04 01:47:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-03-04 01:47:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:47:37,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:37,620 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:37,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:47:37,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:37,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 854571592, now seen corresponding path program 1 times [2025-03-04 01:47:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186920943] [2025-03-04 01:47:37,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:37,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:47:37,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:47:37,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:37,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:38,490 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-04 01:47:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186920943] [2025-03-04 01:47:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186920943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:47:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808520485] [2025-03-04 01:47:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:47:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:47:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:47:38,491 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-04 01:47:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:38,814 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2025-03-04 01:47:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:47:38,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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 115 [2025-03-04 01:47:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:38,815 INFO L225 Difference]: With dead ends: 254 [2025-03-04 01:47:38,815 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 01:47:38,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:47:38,816 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 230 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:38,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 921 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 01:47:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2025-03-04 01:47:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 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-04 01:47:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2025-03-04 01:47:38,825 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 115 [2025-03-04 01:47:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:38,825 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2025-03-04 01:47:38,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-04 01:47:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2025-03-04 01:47:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:47:38,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:38,827 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:38,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:47:38,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:38,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:38,827 INFO L85 PathProgramCache]: Analyzing trace with hash -229719938, now seen corresponding path program 1 times [2025-03-04 01:47:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262136653] [2025-03-04 01:47:38,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:38,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:47:38,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:47:38,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:38,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:47:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262136653] [2025-03-04 01:47:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262136653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:39,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:47:39,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513687391] [2025-03-04 01:47:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:39,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:47:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:39,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:47:39,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:39,500 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-04 01:47:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:39,849 INFO L93 Difference]: Finished difference Result 287 states and 409 transitions. [2025-03-04 01:47:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:47:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 116 [2025-03-04 01:47:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:39,851 INFO L225 Difference]: With dead ends: 287 [2025-03-04 01:47:39,851 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 01:47:39,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:47:39,852 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 232 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:39,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 606 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 01:47:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2025-03-04 01:47:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 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-04 01:47:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2025-03-04 01:47:39,883 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 116 [2025-03-04 01:47:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:39,883 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2025-03-04 01:47:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-04 01:47:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2025-03-04 01:47:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:47:39,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:39,887 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:47:39,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -638544163, now seen corresponding path program 1 times [2025-03-04 01:47:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347129965] [2025-03-04 01:47:39,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:47:39,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:47:39,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:39,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:41,291 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-04 01:47:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347129965] [2025-03-04 01:47:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347129965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:41,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:41,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:47:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011499315] [2025-03-04 01:47:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:41,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:47:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:41,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:47:41,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:41,294 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:41,619 INFO L93 Difference]: Finished difference Result 371 states and 533 transitions. [2025-03-04 01:47:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:47:41,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-04 01:47:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:41,622 INFO L225 Difference]: With dead ends: 371 [2025-03-04 01:47:41,623 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 01:47:41,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:47:41,623 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 384 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:41,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 387 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 01:47:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2025-03-04 01:47:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 199 states have internal predecessors, (277), 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-04 01:47:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2025-03-04 01:47:41,658 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 116 [2025-03-04 01:47:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:41,659 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2025-03-04 01:47:41,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2025-03-04 01:47:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:47:41,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:41,663 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:41,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:47:41,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1639615326, now seen corresponding path program 1 times [2025-03-04 01:47:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996527832] [2025-03-04 01:47:41,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:41,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:47:41,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:47:41,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:41,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:42,527 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-04 01:47:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:42,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996527832] [2025-03-04 01:47:42,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996527832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:42,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:42,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:47:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418837690] [2025-03-04 01:47:42,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:42,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:47:42,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:42,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:47:42,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:47:42,529 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:42,797 INFO L93 Difference]: Finished difference Result 519 states and 750 transitions. [2025-03-04 01:47:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:47:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-04 01:47:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:42,799 INFO L225 Difference]: With dead ends: 519 [2025-03-04 01:47:42,799 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 01:47:42,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:42,800 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 61 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:42,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 604 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 01:47:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 287. [2025-03-04 01:47:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 247 states have internal predecessors, (340), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 412 transitions. [2025-03-04 01:47:42,825 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 412 transitions. Word has length 117 [2025-03-04 01:47:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 412 transitions. [2025-03-04 01:47:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 412 transitions. [2025-03-04 01:47:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:47:42,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:42,827 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:42,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:47:42,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:42,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 39546527, now seen corresponding path program 1 times [2025-03-04 01:47:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139468259] [2025-03-04 01:47:42,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:42,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:47:42,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:47:42,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:42,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:44,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-04 01:47:44,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:44,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139468259] [2025-03-04 01:47:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139468259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:44,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:44,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:47:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172300051] [2025-03-04 01:47:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:44,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:47:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:44,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:47:44,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:47:44,246 INFO L87 Difference]: Start difference. First operand 287 states and 412 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 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-04 01:47:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:44,955 INFO L93 Difference]: Finished difference Result 584 states and 836 transitions. [2025-03-04 01:47:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:47:44,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 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 118 [2025-03-04 01:47:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:44,958 INFO L225 Difference]: With dead ends: 584 [2025-03-04 01:47:44,958 INFO L226 Difference]: Without dead ends: 358 [2025-03-04 01:47:44,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:47:44,961 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 248 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:44,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 664 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:47:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-04 01:47:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 299. [2025-03-04 01:47:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 259 states have (on average 1.3822393822393821) internal successors, (358), 259 states have internal predecessors, (358), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 430 transitions. [2025-03-04 01:47:44,993 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 430 transitions. Word has length 118 [2025-03-04 01:47:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:44,993 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 430 transitions. [2025-03-04 01:47:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 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-04 01:47:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 430 transitions. [2025-03-04 01:47:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:47:44,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:44,994 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:44,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:47:44,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:44,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2029521626, now seen corresponding path program 1 times [2025-03-04 01:47:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:44,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877859447] [2025-03-04 01:47:44,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:45,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:47:45,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:47:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:45,859 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-04 01:47:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877859447] [2025-03-04 01:47:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877859447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:45,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:47:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130262600] [2025-03-04 01:47:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:45,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:47:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:45,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:47:45,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:45,863 INFO L87 Difference]: Start difference. First operand 299 states and 430 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 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-04 01:47:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:46,237 INFO L93 Difference]: Finished difference Result 448 states and 640 transitions. [2025-03-04 01:47:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 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 118 [2025-03-04 01:47:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:46,239 INFO L225 Difference]: With dead ends: 448 [2025-03-04 01:47:46,240 INFO L226 Difference]: Without dead ends: 309 [2025-03-04 01:47:46,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:47:46,240 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 256 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:46,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 409 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-04 01:47:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 297. [2025-03-04 01:47:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 257 states have (on average 1.3696498054474708) internal successors, (352), 257 states have internal predecessors, (352), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2025-03-04 01:47:46,262 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 118 [2025-03-04 01:47:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:46,262 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2025-03-04 01:47:46,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 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-04 01:47:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2025-03-04 01:47:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:47:46,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:46,271 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:46,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:47:46,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:46,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:46,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2023252371, now seen corresponding path program 1 times [2025-03-04 01:47:46,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:46,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961019051] [2025-03-04 01:47:46,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:46,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:46,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:47:46,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:47:46,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:46,608 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-04 01:47:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:46,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961019051] [2025-03-04 01:47:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961019051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:46,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:47:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273632790] [2025-03-04 01:47:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:47:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:46,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:47:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:47:46,610 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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-04 01:47:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:46,935 INFO L93 Difference]: Finished difference Result 632 states and 895 transitions. [2025-03-04 01:47:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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 118 [2025-03-04 01:47:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:46,938 INFO L225 Difference]: With dead ends: 632 [2025-03-04 01:47:46,938 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 01:47:46,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:47:46,939 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 178 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:46,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1174 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:47:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 01:47:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 330. [2025-03-04 01:47:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 290 states have (on average 1.3620689655172413) internal successors, (395), 290 states have internal predecessors, (395), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 467 transitions. [2025-03-04 01:47:46,976 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 467 transitions. Word has length 118 [2025-03-04 01:47:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:46,976 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 467 transitions. [2025-03-04 01:47:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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-04 01:47:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 467 transitions. [2025-03-04 01:47:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:47:46,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:46,978 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:47:46,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1695768255, now seen corresponding path program 1 times [2025-03-04 01:47:46,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:46,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911648041] [2025-03-04 01:47:46,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:46,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:47,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:47:47,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:47:47,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:47,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:47,358 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-04 01:47:47,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:47,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911648041] [2025-03-04 01:47:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911648041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:47,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:47:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619674819] [2025-03-04 01:47:47,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:47:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:47,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:47:47,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:47:47,360 INFO L87 Difference]: Start difference. First operand 330 states and 467 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-04 01:47:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:47,642 INFO L93 Difference]: Finished difference Result 713 states and 1001 transitions. [2025-03-04 01:47:47,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:47:47,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 119 [2025-03-04 01:47:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:47,644 INFO L225 Difference]: With dead ends: 713 [2025-03-04 01:47:47,644 INFO L226 Difference]: Without dead ends: 429 [2025-03-04 01:47:47,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:47:47,645 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 260 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:47,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 389 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:47:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-04 01:47:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 350. [2025-03-04 01:47:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 310 states have (on average 1.3419354838709678) internal successors, (416), 310 states have internal predecessors, (416), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 488 transitions. [2025-03-04 01:47:47,675 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 488 transitions. Word has length 119 [2025-03-04 01:47:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:47,676 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 488 transitions. [2025-03-04 01:47:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-04 01:47:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 488 transitions. [2025-03-04 01:47:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:47:47,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:47,677 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:47:47,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1155468438, now seen corresponding path program 1 times [2025-03-04 01:47:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603595122] [2025-03-04 01:47:47,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:47,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:47:47,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:47:47,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:47,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:48,500 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-04 01:47:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603595122] [2025-03-04 01:47:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603595122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:48,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:48,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:47:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23012615] [2025-03-04 01:47:48,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:48,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:47:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:48,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:47:48,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:47:48,502 INFO L87 Difference]: Start difference. First operand 350 states and 488 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:48,962 INFO L93 Difference]: Finished difference Result 666 states and 926 transitions. [2025-03-04 01:47:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-04 01:47:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:48,964 INFO L225 Difference]: With dead ends: 666 [2025-03-04 01:47:48,964 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 01:47:48,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:47:48,965 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 127 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:48,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 607 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:47:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 01:47:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 359. [2025-03-04 01:47:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 319 states have (on average 1.335423197492163) internal successors, (426), 319 states have internal predecessors, (426), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 498 transitions. [2025-03-04 01:47:48,995 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 498 transitions. Word has length 119 [2025-03-04 01:47:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:48,995 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 498 transitions. [2025-03-04 01:47:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 498 transitions. [2025-03-04 01:47:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:47:48,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:48,996 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:48,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:47:48,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1410204983, now seen corresponding path program 1 times [2025-03-04 01:47:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650062667] [2025-03-04 01:47:48,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:49,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:47:49,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:47:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:50,664 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-04 01:47:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:50,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650062667] [2025-03-04 01:47:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650062667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:50,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:50,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:47:50,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396980813] [2025-03-04 01:47:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:50,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:47:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:50,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:47:50,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:47:50,666 INFO L87 Difference]: Start difference. First operand 359 states and 498 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:51,832 INFO L93 Difference]: Finished difference Result 696 states and 960 transitions. [2025-03-04 01:47:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:47:51,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-04 01:47:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:51,834 INFO L225 Difference]: With dead ends: 696 [2025-03-04 01:47:51,835 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 01:47:51,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:47:51,836 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 268 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:51,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1131 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:47:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 01:47:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 367. [2025-03-04 01:47:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 327 states have (on average 1.3302752293577982) internal successors, (435), 327 states have internal predecessors, (435), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 507 transitions. [2025-03-04 01:47:51,860 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 507 transitions. Word has length 119 [2025-03-04 01:47:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:51,860 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 507 transitions. [2025-03-04 01:47:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 507 transitions. [2025-03-04 01:47:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:47:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:51,862 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:47:51,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:51,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash -165440502, now seen corresponding path program 1 times [2025-03-04 01:47:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143395050] [2025-03-04 01:47:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:51,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:47:51,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:47:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:52,036 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-04 01:47:52,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:52,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143395050] [2025-03-04 01:47:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143395050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:52,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:47:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922167779] [2025-03-04 01:47:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:52,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:47:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:52,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:47:52,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:47:52,039 INFO L87 Difference]: Start difference. First operand 367 states and 507 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-04 01:47:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:52,219 INFO L93 Difference]: Finished difference Result 633 states and 872 transitions. [2025-03-04 01:47:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:47:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 119 [2025-03-04 01:47:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:52,222 INFO L225 Difference]: With dead ends: 633 [2025-03-04 01:47:52,222 INFO L226 Difference]: Without dead ends: 335 [2025-03-04 01:47:52,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:47:52,223 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 9 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:52,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 494 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:47:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-04 01:47:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 327. [2025-03-04 01:47:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 287 states have (on average 1.3066202090592334) internal successors, (375), 287 states have internal predecessors, (375), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 447 transitions. [2025-03-04 01:47:52,262 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 447 transitions. Word has length 119 [2025-03-04 01:47:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:52,262 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 447 transitions. [2025-03-04 01:47:52,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-04 01:47:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 447 transitions. [2025-03-04 01:47:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:47:52,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:52,264 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:52,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:47:52,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:52,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash -414832235, now seen corresponding path program 1 times [2025-03-04 01:47:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:52,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249759690] [2025-03-04 01:47:52,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:52,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:47:52,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:47:52,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:52,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:53,610 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-04 01:47:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249759690] [2025-03-04 01:47:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:47:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553329564] [2025-03-04 01:47:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:53,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:47:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:53,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:47:53,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:47:53,613 INFO L87 Difference]: Start difference. First operand 327 states and 447 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:54,278 INFO L93 Difference]: Finished difference Result 659 states and 892 transitions. [2025-03-04 01:47:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-04 01:47:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:54,280 INFO L225 Difference]: With dead ends: 659 [2025-03-04 01:47:54,280 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 01:47:54,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:47:54,281 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 258 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:54,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 624 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:47:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 01:47:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 349. [2025-03-04 01:47:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 309 states have (on average 1.2944983818770226) internal successors, (400), 309 states have internal predecessors, (400), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 472 transitions. [2025-03-04 01:47:54,301 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 472 transitions. Word has length 120 [2025-03-04 01:47:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:54,303 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 472 transitions. [2025-03-04 01:47:54,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 472 transitions. [2025-03-04 01:47:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:47:54,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:54,304 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:54,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:47:54,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:54,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 278269462, now seen corresponding path program 1 times [2025-03-04 01:47:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:54,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448385239] [2025-03-04 01:47:54,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:54,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:47:54,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:47:54,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:54,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:56,202 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-04 01:47:56,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448385239] [2025-03-04 01:47:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448385239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:56,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:47:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133345670] [2025-03-04 01:47:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:56,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:47:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:56,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:47:56,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:47:56,205 INFO L87 Difference]: Start difference. First operand 349 states and 472 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:57,732 INFO L93 Difference]: Finished difference Result 666 states and 896 transitions. [2025-03-04 01:47:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:47:57,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-04 01:47:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:57,734 INFO L225 Difference]: With dead ends: 666 [2025-03-04 01:47:57,734 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 01:47:57,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:47:57,735 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 525 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:57,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1275 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:47:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 01:47:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 341. [2025-03-04 01:47:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.2956810631229236) internal successors, (390), 301 states have internal predecessors, (390), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:47:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2025-03-04 01:47:57,759 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 120 [2025-03-04 01:47:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:57,760 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2025-03-04 01:47:57,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:47:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2025-03-04 01:47:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:47:57,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:57,761 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:57,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:47:57,761 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:57,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash -207395805, now seen corresponding path program 1 times [2025-03-04 01:47:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:47:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093902313] [2025-03-04 01:47:57,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:47:57,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:47:57,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:47:57,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:57,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:59,637 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-04 01:47:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:47:59,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093902313] [2025-03-04 01:47:59,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093902313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:59,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:59,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:47:59,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918886770] [2025-03-04 01:47:59,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:59,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:47:59,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:47:59,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:47:59,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:47:59,640 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:01,184 INFO L93 Difference]: Finished difference Result 581 states and 778 transitions. [2025-03-04 01:48:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:48:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 121 [2025-03-04 01:48:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:01,186 INFO L225 Difference]: With dead ends: 581 [2025-03-04 01:48:01,186 INFO L226 Difference]: Without dead ends: 440 [2025-03-04 01:48:01,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:48:01,187 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 409 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:01,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1308 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:48:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-04 01:48:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 363. [2025-03-04 01:48:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 321 states have (on average 1.2866043613707165) internal successors, (413), 321 states have internal predecessors, (413), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:48:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 485 transitions. [2025-03-04 01:48:01,213 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 485 transitions. Word has length 121 [2025-03-04 01:48:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:01,213 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 485 transitions. [2025-03-04 01:48:01,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2025-03-04 01:48:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:48:01,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:01,214 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:01,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:48:01,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:01,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash -176375998, now seen corresponding path program 1 times [2025-03-04 01:48:01,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:01,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878698143] [2025-03-04 01:48:01,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:01,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:01,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:48:01,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:48:01,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:01,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:02,019 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-04 01:48:02,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:02,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878698143] [2025-03-04 01:48:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878698143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:02,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:02,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:48:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529845635] [2025-03-04 01:48:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:02,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:48:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:02,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:48:02,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:02,021 INFO L87 Difference]: Start difference. First operand 363 states and 485 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-04 01:48:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:02,427 INFO L93 Difference]: Finished difference Result 595 states and 793 transitions. [2025-03-04 01:48:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:48:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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 121 [2025-03-04 01:48:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:02,429 INFO L225 Difference]: With dead ends: 595 [2025-03-04 01:48:02,429 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 01:48:02,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:48:02,429 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 254 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:02,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 768 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:48:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 01:48:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 351. [2025-03-04 01:48:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 309 states have (on average 1.2880258899676376) internal successors, (398), 309 states have internal predecessors, (398), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:48:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 470 transitions. [2025-03-04 01:48:02,458 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 470 transitions. Word has length 121 [2025-03-04 01:48:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 470 transitions. [2025-03-04 01:48:02,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-04 01:48:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 470 transitions. [2025-03-04 01:48:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:48:02,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:02,459 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:02,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:48:02,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1432466101, now seen corresponding path program 1 times [2025-03-04 01:48:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315505536] [2025-03-04 01:48:02,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:02,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:48:02,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:48:02,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:02,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:02,744 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-04 01:48:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315505536] [2025-03-04 01:48:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315505536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:02,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:48:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143266948] [2025-03-04 01:48:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:02,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:48:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:02,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:48:02,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:02,747 INFO L87 Difference]: Start difference. First operand 351 states and 470 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-04 01:48:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:03,027 INFO L93 Difference]: Finished difference Result 738 states and 982 transitions. [2025-03-04 01:48:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:48:03,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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 121 [2025-03-04 01:48:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:03,029 INFO L225 Difference]: With dead ends: 738 [2025-03-04 01:48:03,029 INFO L226 Difference]: Without dead ends: 455 [2025-03-04 01:48:03,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:03,030 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 209 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:03,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 858 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:48:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-04 01:48:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 379. [2025-03-04 01:48:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:48:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 504 transitions. [2025-03-04 01:48:03,056 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 504 transitions. Word has length 121 [2025-03-04 01:48:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:03,056 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 504 transitions. [2025-03-04 01:48:03,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-04 01:48:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 504 transitions. [2025-03-04 01:48:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:48:03,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:03,057 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:03,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:48:03,057 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:03,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash 824444906, now seen corresponding path program 1 times [2025-03-04 01:48:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:03,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760445185] [2025-03-04 01:48:03,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:03,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:48:03,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:48:03,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:03,780 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-04 01:48:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:03,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760445185] [2025-03-04 01:48:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760445185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:03,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:03,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:48:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813733115] [2025-03-04 01:48:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:48:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:03,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:48:03,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:48:03,782 INFO L87 Difference]: Start difference. First operand 379 states and 504 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 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-04 01:48:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:04,152 INFO L93 Difference]: Finished difference Result 775 states and 1022 transitions. [2025-03-04 01:48:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:48:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 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 121 [2025-03-04 01:48:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:04,155 INFO L225 Difference]: With dead ends: 775 [2025-03-04 01:48:04,155 INFO L226 Difference]: Without dead ends: 464 [2025-03-04 01:48:04,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:48:04,156 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 334 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:04,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 529 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:48:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-04 01:48:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2025-03-04 01:48:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 411 states have (on average 1.2798053527980535) internal successors, (526), 413 states have internal predecessors, (526), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 606 transitions. [2025-03-04 01:48:04,193 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 606 transitions. Word has length 121 [2025-03-04 01:48:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 606 transitions. [2025-03-04 01:48:04,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 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-04 01:48:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 606 transitions. [2025-03-04 01:48:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:04,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:04,195 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:04,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:48:04,195 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:04,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1187529626, now seen corresponding path program 1 times [2025-03-04 01:48:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:04,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603371257] [2025-03-04 01:48:04,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:04,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:04,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:04,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:04,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:05,824 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-04 01:48:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603371257] [2025-03-04 01:48:05,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603371257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:05,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:05,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:48:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143505245] [2025-03-04 01:48:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:05,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:48:05,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:05,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:48:05,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:48:05,826 INFO L87 Difference]: Start difference. First operand 460 states and 606 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:07,463 INFO L93 Difference]: Finished difference Result 791 states and 1037 transitions. [2025-03-04 01:48:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:48:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-03-04 01:48:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:07,468 INFO L225 Difference]: With dead ends: 791 [2025-03-04 01:48:07,468 INFO L226 Difference]: Without dead ends: 585 [2025-03-04 01:48:07,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:48:07,469 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 345 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:07,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1009 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:48:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-04 01:48:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 473. [2025-03-04 01:48:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 424 states have (on average 1.275943396226415) internal successors, (541), 426 states have internal predecessors, (541), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 621 transitions. [2025-03-04 01:48:07,513 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 621 transitions. Word has length 122 [2025-03-04 01:48:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 621 transitions. [2025-03-04 01:48:07,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 621 transitions. [2025-03-04 01:48:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:07,514 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:48:07,514 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2145823653, now seen corresponding path program 1 times [2025-03-04 01:48:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767151576] [2025-03-04 01:48:07,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:07,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:07,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:07,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:07,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:08,211 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-04 01:48:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767151576] [2025-03-04 01:48:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767151576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:08,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:48:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341774835] [2025-03-04 01:48:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:48:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:08,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:48:08,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:08,214 INFO L87 Difference]: Start difference. First operand 473 states and 621 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-04 01:48:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:08,796 INFO L93 Difference]: Finished difference Result 789 states and 1034 transitions. [2025-03-04 01:48:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:48:08,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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 122 [2025-03-04 01:48:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:08,798 INFO L225 Difference]: With dead ends: 789 [2025-03-04 01:48:08,798 INFO L226 Difference]: Without dead ends: 570 [2025-03-04 01:48:08,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:48:08,799 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 296 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:08,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 703 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:48:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-04 01:48:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 462. [2025-03-04 01:48:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 413 states have (on average 1.278450363196126) internal successors, (528), 415 states have internal predecessors, (528), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 608 transitions. [2025-03-04 01:48:08,847 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 608 transitions. Word has length 122 [2025-03-04 01:48:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:08,847 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 608 transitions. [2025-03-04 01:48:08,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-04 01:48:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 608 transitions. [2025-03-04 01:48:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:08,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:08,848 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:08,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:48:08,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:08,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash 775699952, now seen corresponding path program 1 times [2025-03-04 01:48:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:08,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670722176] [2025-03-04 01:48:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:08,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:08,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:08,985 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-04 01:48:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670722176] [2025-03-04 01:48:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670722176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:08,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081570772] [2025-03-04 01:48:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:08,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:48:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:08,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:48:08,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:08,987 INFO L87 Difference]: Start difference. First operand 462 states and 608 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-04 01:48:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:09,129 INFO L93 Difference]: Finished difference Result 908 states and 1196 transitions. [2025-03-04 01:48:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:48:09,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 122 [2025-03-04 01:48:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:09,132 INFO L225 Difference]: With dead ends: 908 [2025-03-04 01:48:09,132 INFO L226 Difference]: Without dead ends: 518 [2025-03-04 01:48:09,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:09,133 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 81 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:09,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 369 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-04 01:48:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 470. [2025-03-04 01:48:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 421 states have (on average 1.2707838479809976) internal successors, (535), 423 states have internal predecessors, (535), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 615 transitions. [2025-03-04 01:48:09,171 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 615 transitions. Word has length 122 [2025-03-04 01:48:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:09,172 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 615 transitions. [2025-03-04 01:48:09,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-04 01:48:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 615 transitions. [2025-03-04 01:48:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:09,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:09,173 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:09,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:48:09,174 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash -589909973, now seen corresponding path program 1 times [2025-03-04 01:48:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490149331] [2025-03-04 01:48:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:09,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:09,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:09,988 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-04 01:48:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490149331] [2025-03-04 01:48:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490149331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:48:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870008715] [2025-03-04 01:48:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:48:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:09,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:48:09,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:48:09,989 INFO L87 Difference]: Start difference. First operand 470 states and 615 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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-04 01:48:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:10,602 INFO L93 Difference]: Finished difference Result 1088 states and 1414 transitions. [2025-03-04 01:48:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:48:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 122 [2025-03-04 01:48:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:10,605 INFO L225 Difference]: With dead ends: 1088 [2025-03-04 01:48:10,605 INFO L226 Difference]: Without dead ends: 690 [2025-03-04 01:48:10,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:48:10,606 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 231 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:10,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1152 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:48:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-04 01:48:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 488. [2025-03-04 01:48:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 439 states have (on average 1.2642369020501139) internal successors, (555), 441 states have internal predecessors, (555), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 635 transitions. [2025-03-04 01:48:10,644 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 635 transitions. Word has length 122 [2025-03-04 01:48:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 635 transitions. [2025-03-04 01:48:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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-04 01:48:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 635 transitions. [2025-03-04 01:48:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:10,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:10,646 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:48:10,646 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:10,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1908105964, now seen corresponding path program 1 times [2025-03-04 01:48:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559902610] [2025-03-04 01:48:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:10,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:10,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:10,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559902610] [2025-03-04 01:48:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559902610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:48:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411920910] [2025-03-04 01:48:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:12,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:48:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:12,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:48:12,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:48:12,006 INFO L87 Difference]: Start difference. First operand 488 states and 635 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 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-04 01:48:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:12,861 INFO L93 Difference]: Finished difference Result 1084 states and 1408 transitions. [2025-03-04 01:48:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:48:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 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 122 [2025-03-04 01:48:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:12,864 INFO L225 Difference]: With dead ends: 1084 [2025-03-04 01:48:12,864 INFO L226 Difference]: Without dead ends: 686 [2025-03-04 01:48:12,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:48:12,865 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 419 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:12,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 732 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:48:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-04 01:48:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 488. [2025-03-04 01:48:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 439 states have (on average 1.2619589977220957) internal successors, (554), 441 states have internal predecessors, (554), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 634 transitions. [2025-03-04 01:48:12,921 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 634 transitions. Word has length 122 [2025-03-04 01:48:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:12,921 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 634 transitions. [2025-03-04 01:48:12,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 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-04 01:48:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 634 transitions. [2025-03-04 01:48:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:12,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:12,922 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:12,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:48:12,922 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -239110036, now seen corresponding path program 1 times [2025-03-04 01:48:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931360549] [2025-03-04 01:48:12,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:12,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:13,328 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-04 01:48:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931360549] [2025-03-04 01:48:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931360549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:48:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934380799] [2025-03-04 01:48:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:48:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:48:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:48:13,329 INFO L87 Difference]: Start difference. First operand 488 states and 634 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-04 01:48:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:13,586 INFO L93 Difference]: Finished difference Result 1028 states and 1338 transitions. [2025-03-04 01:48:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:48:13,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 122 [2025-03-04 01:48:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:13,589 INFO L225 Difference]: With dead ends: 1028 [2025-03-04 01:48:13,589 INFO L226 Difference]: Without dead ends: 630 [2025-03-04 01:48:13,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:48:13,590 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 223 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:13,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 428 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:48:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-04 01:48:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 565. [2025-03-04 01:48:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 516 states have (on average 1.253875968992248) internal successors, (647), 518 states have internal predecessors, (647), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 727 transitions. [2025-03-04 01:48:13,632 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 727 transitions. Word has length 122 [2025-03-04 01:48:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:13,633 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 727 transitions. [2025-03-04 01:48:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-04 01:48:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 727 transitions. [2025-03-04 01:48:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:48:13,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:13,635 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:13,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:48:13,635 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:13,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2036061395, now seen corresponding path program 1 times [2025-03-04 01:48:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117000513] [2025-03-04 01:48:13,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:13,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:48:13,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:48:13,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:13,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:16,002 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-04 01:48:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117000513] [2025-03-04 01:48:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117000513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:16,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:48:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609635035] [2025-03-04 01:48:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:16,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:48:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:16,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:48:16,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:48:16,005 INFO L87 Difference]: Start difference. First operand 565 states and 727 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:17,926 INFO L93 Difference]: Finished difference Result 1103 states and 1417 transitions. [2025-03-04 01:48:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:48:17,926 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:48:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:17,928 INFO L225 Difference]: With dead ends: 1103 [2025-03-04 01:48:17,928 INFO L226 Difference]: Without dead ends: 628 [2025-03-04 01:48:17,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:48:17,929 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 406 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:17,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1835 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:48:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-04 01:48:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 570. [2025-03-04 01:48:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 521 states have (on average 1.251439539347409) internal successors, (652), 523 states have internal predecessors, (652), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 732 transitions. [2025-03-04 01:48:17,965 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 732 transitions. Word has length 122 [2025-03-04 01:48:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:17,966 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 732 transitions. [2025-03-04 01:48:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 732 transitions. [2025-03-04 01:48:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:48:17,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:17,966 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:17,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:48:17,967 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:17,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:17,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1247810891, now seen corresponding path program 1 times [2025-03-04 01:48:17,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:17,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633178945] [2025-03-04 01:48:17,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:17,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:17,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:48:18,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:48:18,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:18,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:18,882 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-04 01:48:18,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633178945] [2025-03-04 01:48:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633178945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:48:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697903806] [2025-03-04 01:48:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:18,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:48:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:18,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:48:18,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:48:18,884 INFO L87 Difference]: Start difference. First operand 570 states and 732 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-04 01:48:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:19,558 INFO L93 Difference]: Finished difference Result 903 states and 1165 transitions. [2025-03-04 01:48:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:48:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 124 [2025-03-04 01:48:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:19,560 INFO L225 Difference]: With dead ends: 903 [2025-03-04 01:48:19,560 INFO L226 Difference]: Without dead ends: 622 [2025-03-04 01:48:19,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:48:19,561 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 177 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:19,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1217 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:48:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-04 01:48:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 576. [2025-03-04 01:48:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 527 states have (on average 1.2485768500948766) internal successors, (658), 529 states have internal predecessors, (658), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 738 transitions. [2025-03-04 01:48:19,598 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 738 transitions. Word has length 124 [2025-03-04 01:48:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 738 transitions. [2025-03-04 01:48:19,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-04 01:48:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 738 transitions. [2025-03-04 01:48:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:48:19,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:19,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:19,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:48:19,600 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:19,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1681546480, now seen corresponding path program 1 times [2025-03-04 01:48:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:19,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699883949] [2025-03-04 01:48:19,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:19,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:48:19,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:48:19,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:19,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:19,715 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-04 01:48:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699883949] [2025-03-04 01:48:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699883949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908940463] [2025-03-04 01:48:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:48:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:19,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:48:19,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:19,716 INFO L87 Difference]: Start difference. First operand 576 states and 738 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:48:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:19,812 INFO L93 Difference]: Finished difference Result 901 states and 1157 transitions. [2025-03-04 01:48:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:48:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 124 [2025-03-04 01:48:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:19,814 INFO L225 Difference]: With dead ends: 901 [2025-03-04 01:48:19,814 INFO L226 Difference]: Without dead ends: 614 [2025-03-04 01:48:19,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:19,815 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 76 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:19,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 434 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-04 01:48:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 576. [2025-03-04 01:48:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 527 states have (on average 1.2447817836812145) internal successors, (656), 529 states have internal predecessors, (656), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 736 transitions. [2025-03-04 01:48:19,851 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 736 transitions. Word has length 124 [2025-03-04 01:48:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 736 transitions. [2025-03-04 01:48:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:48:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 736 transitions. [2025-03-04 01:48:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:48:19,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:19,852 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:19,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:48:19,853 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:19,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1543252133, now seen corresponding path program 1 times [2025-03-04 01:48:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512683021] [2025-03-04 01:48:19,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:48:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:48:19,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:19,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:19,959 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-04 01:48:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512683021] [2025-03-04 01:48:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512683021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:48:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172065213] [2025-03-04 01:48:19,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:19,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:19,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:19,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:48:19,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:48:20,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:48:20,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:48:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:20,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:48:20,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:20,216 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-04 01:48:20,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172065213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:20,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:48:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:48:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097725291] [2025-03-04 01:48:20,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:20,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:48:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:20,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:48:20,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:48:20,219 INFO L87 Difference]: Start difference. First operand 576 states and 736 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:48:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:20,271 INFO L93 Difference]: Finished difference Result 1078 states and 1377 transitions. [2025-03-04 01:48:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:48:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 124 [2025-03-04 01:48:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:20,275 INFO L225 Difference]: With dead ends: 1078 [2025-03-04 01:48:20,275 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 01:48:20,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:48:20,276 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:20,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 01:48:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-03-04 01:48:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 539 states have (on average 1.2393320964749537) internal successors, (668), 541 states have internal predecessors, (668), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 748 transitions. [2025-03-04 01:48:20,318 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 748 transitions. Word has length 124 [2025-03-04 01:48:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:20,318 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 748 transitions. [2025-03-04 01:48:20,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-04 01:48:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 748 transitions. [2025-03-04 01:48:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:48:20,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:20,319 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:20,326 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-04 01:48:20,519 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,SelfDestructingSolverStorable28 [2025-03-04 01:48:20,519 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:20,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 318026404, now seen corresponding path program 1 times [2025-03-04 01:48:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831946239] [2025-03-04 01:48:20,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:20,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:48:20,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:48:20,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:21,578 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-04 01:48:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831946239] [2025-03-04 01:48:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831946239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:48:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75119182] [2025-03-04 01:48:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:48:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:21,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:48:21,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:21,579 INFO L87 Difference]: Start difference. First operand 588 states and 748 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 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-04 01:48:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:22,709 INFO L93 Difference]: Finished difference Result 1334 states and 1683 transitions. [2025-03-04 01:48:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:48:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 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 125 [2025-03-04 01:48:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:22,711 INFO L225 Difference]: With dead ends: 1334 [2025-03-04 01:48:22,711 INFO L226 Difference]: Without dead ends: 832 [2025-03-04 01:48:22,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:48:22,713 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 230 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:22,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1847 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:48:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-04 01:48:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 619. [2025-03-04 01:48:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 570 states have (on average 1.2350877192982457) internal successors, (704), 572 states have internal predecessors, (704), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 784 transitions. [2025-03-04 01:48:22,766 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 784 transitions. Word has length 125 [2025-03-04 01:48:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:22,766 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 784 transitions. [2025-03-04 01:48:22,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 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-04 01:48:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 784 transitions. [2025-03-04 01:48:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:48:22,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:22,767 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:48:22,767 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:22,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash -794520825, now seen corresponding path program 1 times [2025-03-04 01:48:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:22,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956431259] [2025-03-04 01:48:22,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:22,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:48:22,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:48:22,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:22,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:22,887 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-04 01:48:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956431259] [2025-03-04 01:48:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956431259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:22,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734125189] [2025-03-04 01:48:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:22,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:48:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:22,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:48:22,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:22,888 INFO L87 Difference]: Start difference. First operand 619 states and 784 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04 01:48:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:23,048 INFO L93 Difference]: Finished difference Result 1153 states and 1462 transitions. [2025-03-04 01:48:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:48:23,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 126 [2025-03-04 01:48:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:23,052 INFO L225 Difference]: With dead ends: 1153 [2025-03-04 01:48:23,052 INFO L226 Difference]: Without dead ends: 651 [2025-03-04 01:48:23,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:23,053 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 31 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:23,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 478 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-04 01:48:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 615. [2025-03-04 01:48:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 566 states have (on average 1.2296819787985867) internal successors, (696), 568 states have internal predecessors, (696), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 776 transitions. [2025-03-04 01:48:23,089 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 776 transitions. Word has length 126 [2025-03-04 01:48:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:23,089 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 776 transitions. [2025-03-04 01:48:23,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04 01:48:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 776 transitions. [2025-03-04 01:48:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:48:23,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:23,090 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:23,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:48:23,090 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:23,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1440315537, now seen corresponding path program 1 times [2025-03-04 01:48:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038932680] [2025-03-04 01:48:23,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:48:23,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:48:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:24,478 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-04 01:48:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038932680] [2025-03-04 01:48:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038932680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:24,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:48:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410012227] [2025-03-04 01:48:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:48:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:24,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:48:24,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:48:24,480 INFO L87 Difference]: Start difference. First operand 615 states and 776 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:25,812 INFO L93 Difference]: Finished difference Result 1014 states and 1275 transitions. [2025-03-04 01:48:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:48:25,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2025-03-04 01:48:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:25,815 INFO L225 Difference]: With dead ends: 1014 [2025-03-04 01:48:25,815 INFO L226 Difference]: Without dead ends: 719 [2025-03-04 01:48:25,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:48:25,816 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 190 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:25,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1207 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:48:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-04 01:48:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 673. [2025-03-04 01:48:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 624 states have (on average 1.2243589743589745) internal successors, (764), 626 states have internal predecessors, (764), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 844 transitions. [2025-03-04 01:48:25,858 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 844 transitions. Word has length 128 [2025-03-04 01:48:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:25,858 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 844 transitions. [2025-03-04 01:48:25,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 844 transitions. [2025-03-04 01:48:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:48:25,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:25,859 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:25,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:48:25,859 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:25,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash -367138926, now seen corresponding path program 1 times [2025-03-04 01:48:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:25,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279828297] [2025-03-04 01:48:25,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:25,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:25,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:48:25,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:48:25,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:25,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:26,186 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-04 01:48:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279828297] [2025-03-04 01:48:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279828297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:48:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304125165] [2025-03-04 01:48:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:48:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:48:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:48:26,187 INFO L87 Difference]: Start difference. First operand 673 states and 844 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-04 01:48:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:26,416 INFO L93 Difference]: Finished difference Result 1058 states and 1325 transitions. [2025-03-04 01:48:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:48:26,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 128 [2025-03-04 01:48:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:26,418 INFO L225 Difference]: With dead ends: 1058 [2025-03-04 01:48:26,418 INFO L226 Difference]: Without dead ends: 705 [2025-03-04 01:48:26,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:48:26,419 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 178 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:26,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 481 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:48:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-04 01:48:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 673. [2025-03-04 01:48:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 624 states have (on average 1.2211538461538463) internal successors, (762), 626 states have internal predecessors, (762), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 842 transitions. [2025-03-04 01:48:26,456 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 842 transitions. Word has length 128 [2025-03-04 01:48:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:26,457 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 842 transitions. [2025-03-04 01:48:26,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-04 01:48:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 842 transitions. [2025-03-04 01:48:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:48:26,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:26,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:48:26,458 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:26,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash -743361390, now seen corresponding path program 1 times [2025-03-04 01:48:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485973889] [2025-03-04 01:48:26,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:26,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:48:26,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:48:26,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:26,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:26,773 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-04 01:48:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485973889] [2025-03-04 01:48:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485973889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:48:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104033623] [2025-03-04 01:48:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:26,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:48:26,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:48:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:48:26,774 INFO L87 Difference]: Start difference. First operand 673 states and 842 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-04 01:48:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:26,985 INFO L93 Difference]: Finished difference Result 1062 states and 1327 transitions. [2025-03-04 01:48:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:48:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 128 [2025-03-04 01:48:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:26,987 INFO L225 Difference]: With dead ends: 1062 [2025-03-04 01:48:26,987 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 01:48:26,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:48:26,988 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 191 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:26,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 475 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:48:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 01:48:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 673. [2025-03-04 01:48:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 624 states have (on average 1.2179487179487178) internal successors, (760), 626 states have internal predecessors, (760), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 840 transitions. [2025-03-04 01:48:27,026 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 840 transitions. Word has length 128 [2025-03-04 01:48:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 840 transitions. [2025-03-04 01:48:27,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-04 01:48:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 840 transitions. [2025-03-04 01:48:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:48:27,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:27,027 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:48:27,027 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:27,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1744151443, now seen corresponding path program 1 times [2025-03-04 01:48:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229757270] [2025-03-04 01:48:27,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:27,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:48:27,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:48:27,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:27,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:30,862 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-04 01:48:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229757270] [2025-03-04 01:48:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229757270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:30,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:30,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-04 01:48:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410851492] [2025-03-04 01:48:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:30,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:48:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:30,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:48:30,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:48:30,864 INFO L87 Difference]: Start difference. First operand 673 states and 840 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:35,302 INFO L93 Difference]: Finished difference Result 1098 states and 1366 transitions. [2025-03-04 01:48:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:48:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2025-03-04 01:48:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:35,304 INFO L225 Difference]: With dead ends: 1098 [2025-03-04 01:48:35,304 INFO L226 Difference]: Without dead ends: 745 [2025-03-04 01:48:35,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 01:48:35,305 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 306 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:35,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1619 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:48:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-04 01:48:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 669. [2025-03-04 01:48:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 620 states have (on average 1.2193548387096773) internal successors, (756), 622 states have internal predecessors, (756), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:48:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 836 transitions. [2025-03-04 01:48:35,353 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 836 transitions. Word has length 128 [2025-03-04 01:48:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:35,354 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 836 transitions. [2025-03-04 01:48:35,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 836 transitions. [2025-03-04 01:48:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:48:35,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:35,354 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:48:35,355 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 746882626, now seen corresponding path program 1 times [2025-03-04 01:48:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075652908] [2025-03-04 01:48:35,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:35,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:48:35,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:48:35,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:35,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:48:35,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:48:35,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:48:35,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:48:35,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:48:35,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:48:35,540 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:48:35,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:48:35,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:48:35,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:35,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:48:35,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:48:35 BoogieIcfgContainer [2025-03-04 01:48:35,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:48:35,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:48:35,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:48:35,645 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:48:35,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:47:36" (3/4) ... [2025-03-04 01:48:35,647 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:48:35,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:48:35,649 INFO L158 Benchmark]: Toolchain (without parser) took 60265.24ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 122.3MB in the beginning and 925.4MB in the end (delta: -803.1MB). Peak memory consumption was 173.1MB. Max. memory is 16.1GB. [2025-03-04 01:48:35,649 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:35,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.78ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 107.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:48:35,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.41ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:35,650 INFO L158 Benchmark]: Boogie Preprocessor took 45.28ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:35,651 INFO L158 Benchmark]: IcfgBuilder took 543.67ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 68.2MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:48:35,652 INFO L158 Benchmark]: TraceAbstraction took 59363.23ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 67.8MB in the beginning and 925.8MB in the end (delta: -858.0MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2025-03-04 01:48:35,652 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 1.1GB. Free memory was 925.8MB in the beginning and 925.4MB in the end (delta: 364.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:48:35,652 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.33ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.78ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 107.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.41ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.28ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 543.67ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 68.2MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59363.23ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 67.8MB in the beginning and 925.8MB in the end (delta: -858.0MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 1.1GB. Free memory was 925.8MB in the beginning and 925.4MB in the end (delta: 364.4kB). 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 someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L53] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] signed long int last_1_WrapperStruct00_var_1_10 = -10; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=0, last_1_WrapperStruct00_var_1_10=-10] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_10 [L117] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+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:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+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:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+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:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L113] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L128] RET updateVariables() [L129] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L67] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] (*(WrapperStruct00_var_1_8_Pointer)) = ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))) [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L72] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L75] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_2_Pointer)); [L76] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)); [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10] [L77] COND TRUE stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10] [L78] COND FALSE !(stepLocal_0 < (*(WrapperStruct00_var_1_8_Pointer))) [L83] (*(WrapperStruct00_var_1_1_Pointer)) = 2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] (*(WrapperStruct00_var_1_11_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120-L121] return (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) ; [L130] RET, EXPR property() [L130] 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:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7626 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7622 mSDsluCounter, 27776 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22942 mSDsCounter, 686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20992 IncrementalHoareTripleChecker+Invalid, 21678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 686 mSolverCounterUnsat, 4834 mSDtfsCounter, 20992 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 417 SyntacticMatches, 26 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=32, InterpolantAutomatonStates: 294, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 2040 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 4604 NumberOfCodeBlocks, 4604 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4439 ConstructedInterpolants, 0 QuantifiedInterpolants, 68044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 984 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 35 PerfectInterpolantSequences, 9713/9768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:48:35,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:48:37,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:48:37,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:48:37,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:48:37,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:48:37,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:48:37,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:48:37,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:48:37,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:48:37,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:48:37,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:48:37,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:48:37,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:48:37,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:48:37,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:48:37,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:48:37,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:48:37,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:48:37,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:48:37,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:48:37,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:48:37,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:48:37,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:48:37,586 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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2025-03-04 01:48:37,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:48:37,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:48:37,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:48:37,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:48:37,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:48:37,831 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-15.i [2025-03-04 01:48:38,983 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78eb5be99/bcec6fdccaf646f988d5505fc1114e59/FLAGe4ee526e8 [2025-03-04 01:48:39,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:48:39,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2025-03-04 01:48:39,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78eb5be99/bcec6fdccaf646f988d5505fc1114e59/FLAGe4ee526e8 [2025-03-04 01:48:39,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78eb5be99/bcec6fdccaf646f988d5505fc1114e59 [2025-03-04 01:48:39,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:48:39,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:48:39,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:48:39,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:48:39,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:48:39,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51596c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39, skipping insertion in model container [2025-03-04 01:48:39,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:48:39,670 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-15.i[917,930] [2025-03-04 01:48:39,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:48:39,721 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:48:39,728 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-15.i[917,930] [2025-03-04 01:48:39,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:48:39,775 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:48:39,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39 WrapperNode [2025-03-04 01:48:39,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:48:39,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:48:39,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:48:39,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:48:39,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,835 INFO L138 Inliner]: procedures = 34, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2025-03-04 01:48:39,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:48:39,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:48:39,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:48:39,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:48:39,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,868 INFO L175 MemorySlicer]: Split 128 memory accesses to 2 slices as follows [2, 126]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-03-04 01:48:39,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:48:39,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:48:39,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:48:39,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:48:39,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (1/1) ... [2025-03-04 01:48:39,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:48:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:39,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:48:39,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:48:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:48:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:48:39,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:48:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:48:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:48:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:48:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:48:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:48:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:48:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:48:39,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:48:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:48:39,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:48:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:48:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:48:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:48:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:48:40,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:48:40,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:48:42,324 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-03-04 01:48:42,356 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-04 01:48:42,356 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:48:42,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:48:42,367 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:48:42,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:42 BoogieIcfgContainer [2025-03-04 01:48:42,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:48:42,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:48:42,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:48:42,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:48:42,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:48:39" (1/3) ... [2025-03-04 01:48:42,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fed0145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:42, skipping insertion in model container [2025-03-04 01:48:42,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:39" (2/3) ... [2025-03-04 01:48:42,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fed0145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:42, skipping insertion in model container [2025-03-04 01:48:42,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:42" (3/3) ... [2025-03-04 01:48:42,375 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2025-03-04 01:48:42,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:48:42,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:48:42,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:48:42,435 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;@2ec2911e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:48:42,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:48:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 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-04 01:48:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:48:42,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:42,447 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:42,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1281715819, now seen corresponding path program 1 times [2025-03-04 01:48:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:42,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488908510] [2025-03-04 01:48:42,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:42,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:42,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:42,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:48:42,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:48:42,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:48:42,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:42,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:42,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:48:42,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 01:48:42,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:42,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488908510] [2025-03-04 01:48:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488908510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:48:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732908119] [2025-03-04 01:48:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:42,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:48:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:42,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:48:42,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:48:42,950 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-04 01:48:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:42,971 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-03-04 01:48:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:48:42,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 115 [2025-03-04 01:48:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:42,977 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:48:42,977 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:48:42,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:48:42,981 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:42,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:48:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:48:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 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-04 01:48:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:48:43,009 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-03-04 01:48:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:43,009 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:48:43,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-04 01:48:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:48:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:48:43,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:43,011 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:43,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:48:43,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:43,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash -869919700, now seen corresponding path program 1 times [2025-03-04 01:48:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303742360] [2025-03-04 01:48:43,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:43,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:43,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:48:43,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:48:43,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:48:43,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:43,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:43,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:48:43,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:43,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:48:43,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:48:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 01:48:43,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:43,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303742360] [2025-03-04 01:48:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303742360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:43,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107850930] [2025-03-04 01:48:43,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:43,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:48:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:43,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:48:43,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:43,895 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:48:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:46,460 INFO L93 Difference]: Finished difference Result 216 states and 312 transitions. [2025-03-04 01:48:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:48:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 115 [2025-03-04 01:48:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:46,467 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:48:46,467 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:48:46,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:48:46,468 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:46,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 443 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 01:48:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:48:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 01:48:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 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-04 01:48:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-04 01:48:46,475 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 115 [2025-03-04 01:48:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:46,476 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-04 01:48:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:48:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-04 01:48:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:48:46,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:46,477 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:46,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:48:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:46,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1607941327, now seen corresponding path program 1 times [2025-03-04 01:48:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780141996] [2025-03-04 01:48:46,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:46,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:46,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:48:46,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.