./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.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-s_file-84.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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:44:38,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:44:38,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:44:38,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:44:38,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:44:38,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:44:38,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:44:38,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:44:38,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:44:38,572 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:44:38,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:44:38,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:44:38,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:44:38,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:44:38,573 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:44:38,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:44:38,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:44:38,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:44:38,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:38,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:44:38,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:44:38,575 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2025-03-04 01:44:38,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:44:38,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:44:38,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:44:38,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:44:38,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:44:38,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-04 01:44:39,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd42af56/3fbb08e577eb48bab8f499bda5b5f8bd/FLAGc25c646bd [2025-03-04 01:44:40,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:44:40,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-04 01:44:40,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd42af56/3fbb08e577eb48bab8f499bda5b5f8bd/FLAGc25c646bd [2025-03-04 01:44:40,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd42af56/3fbb08e577eb48bab8f499bda5b5f8bd [2025-03-04 01:44:40,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:44:40,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:44:40,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:40,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:44:40,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:44:40,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40, skipping insertion in model container [2025-03-04 01:44:40,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:44:40,690 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-s_file-84.i[916,929] [2025-03-04 01:44:40,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:40,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:44:40,778 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-s_file-84.i[916,929] [2025-03-04 01:44:40,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:40,832 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:44:40,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40 WrapperNode [2025-03-04 01:44:40,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:40,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:40,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:44:40,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:44:40,838 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:44:40" (1/1) ... [2025-03-04 01:44:40,847 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:44:40" (1/1) ... [2025-03-04 01:44:40,889 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2025-03-04 01:44:40,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:40,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:44:40,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:44:40,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:44:40,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,921 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:44:40,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:44:40,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:44:40,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:44:40,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:44:40,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (1/1) ... [2025-03-04 01:44:40,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:40,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:40,980 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:44:40,986 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:44:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:44:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:44:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:44:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:44:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:44:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:44:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:44:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:44:41,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:44:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:44:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:44:41,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:44:41,092 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:44:41,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:44:41,599 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem78#1;havoc property_#t~ite85#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1; [2025-03-04 01:44:41,645 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-04 01:44:41,645 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:44:41,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:44:41,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:44:41,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:41 BoogieIcfgContainer [2025-03-04 01:44:41,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:44:41,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:44:41,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:44:41,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:44:41,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:44:40" (1/3) ... [2025-03-04 01:44:41,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1089f04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:41, skipping insertion in model container [2025-03-04 01:44:41,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:40" (2/3) ... [2025-03-04 01:44:41,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1089f04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:41, skipping insertion in model container [2025-03-04 01:44:41,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:41" (3/3) ... [2025-03-04 01:44:41,661 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2025-03-04 01:44:41,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:44:41,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-84.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:44:41,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:44:41,732 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;@454b9aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:44:41,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:44:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:44:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:44:41,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:41,743 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 977022174, now seen corresponding path program 1 times [2025-03-04 01:44:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773519024] [2025-03-04 01:44:41,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:41,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:44:41,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:44:41,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:41,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:44:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773519024] [2025-03-04 01:44:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773519024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959980063] [2025-03-04 01:44:42,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:42,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:42,125 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:44:42,126 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:44:42,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:44:42,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:44:42,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:42,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:42,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:44:42,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 01:44:42,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959980063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:42,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:44:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685886801] [2025-03-04 01:44:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:44:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:42,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:44:42,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:44:42,402 INFO L87 Difference]: Start difference. First operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:44:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:42,423 INFO L93 Difference]: Finished difference Result 198 states and 307 transitions. [2025-03-04 01:44:42,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:44:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2025-03-04 01:44:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:42,429 INFO L225 Difference]: With dead ends: 198 [2025-03-04 01:44:42,429 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 01:44:42,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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:44:42,436 INFO L435 NwaCegarLoop]: 141 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, 141 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:44:42,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 01:44:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 01:44:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:44:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-04 01:44:42,469 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2025-03-04 01:44:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:42,469 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-04 01:44:42,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:44:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-04 01:44:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:44:42,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:42,471 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:42,478 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:44:42,672 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:44:42,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:42,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1030975248, now seen corresponding path program 1 times [2025-03-04 01:44:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:42,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319220445] [2025-03-04 01:44:42,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:42,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:42,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:44:42,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:44:42,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:42,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319220445] [2025-03-04 01:44:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319220445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:43,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:43,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041017823] [2025-03-04 01:44:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:43,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:43,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:43,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:43,612 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:44:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:43,958 INFO L93 Difference]: Finished difference Result 322 states and 460 transitions. [2025-03-04 01:44:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-03-04 01:44:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:43,963 INFO L225 Difference]: With dead ends: 322 [2025-03-04 01:44:43,963 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 01:44:43,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:43,964 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 163 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:43,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 451 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 01:44:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 195. [2025-03-04 01:44:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:44:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2025-03-04 01:44:43,994 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 150 [2025-03-04 01:44:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:43,995 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2025-03-04 01:44:43,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:44:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2025-03-04 01:44:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:44:43,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:43,998 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:44:43,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash 412366658, now seen corresponding path program 1 times [2025-03-04 01:44:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226183252] [2025-03-04 01:44:44,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:44,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:44:44,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:44:44,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:44,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226183252] [2025-03-04 01:44:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226183252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296284373] [2025-03-04 01:44:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:44,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:44,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:44,179 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:44:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:44,210 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2025-03-04 01:44:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-03-04 01:44:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:44,214 INFO L225 Difference]: With dead ends: 393 [2025-03-04 01:44:44,215 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:44:44,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:44,218 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:44,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:44:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-03-04 01:44:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.294871794871795) internal successors, (202), 156 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:44:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2025-03-04 01:44:44,248 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 158 [2025-03-04 01:44:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:44,249 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2025-03-04 01:44:44,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:44:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2025-03-04 01:44:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:44:44,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:44,253 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:44:44,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 413290179, now seen corresponding path program 1 times [2025-03-04 01:44:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755361343] [2025-03-04 01:44:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:44,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:44:44,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:44:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:46,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755361343] [2025-03-04 01:44:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755361343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:46,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:44:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315885286] [2025-03-04 01:44:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:46,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:44:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:46,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:44:46,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:44:46,742 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:47,685 INFO L93 Difference]: Finished difference Result 485 states and 685 transitions. [2025-03-04 01:44:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:44:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-04 01:44:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:47,688 INFO L225 Difference]: With dead ends: 485 [2025-03-04 01:44:47,688 INFO L226 Difference]: Without dead ends: 289 [2025-03-04 01:44:47,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:44:47,689 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 60 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:47,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1033 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:44:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-04 01:44:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2025-03-04 01:44:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3105263157894738) internal successors, (249), 190 states have internal predecessors, (249), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:44:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2025-03-04 01:44:47,720 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 158 [2025-03-04 01:44:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:47,721 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2025-03-04 01:44:47,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2025-03-04 01:44:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:44:47,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:47,723 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:47,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:44:47,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:47,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1740687995, now seen corresponding path program 1 times [2025-03-04 01:44:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838609251] [2025-03-04 01:44:47,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:47,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:44:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:44:47,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:49,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:49,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838609251] [2025-03-04 01:44:49,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838609251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:44:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005708835] [2025-03-04 01:44:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:49,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:44:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:49,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:44:49,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:49,207 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:50,115 INFO L93 Difference]: Finished difference Result 575 states and 807 transitions. [2025-03-04 01:44:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:50,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:44:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:50,118 INFO L225 Difference]: With dead ends: 575 [2025-03-04 01:44:50,118 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 01:44:50,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:50,119 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 58 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:50,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 795 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:44:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 01:44:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2025-03-04 01:44:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 292 states have (on average 1.3287671232876712) internal successors, (388), 294 states have internal predecessors, (388), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:44:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2025-03-04 01:44:50,144 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 160 [2025-03-04 01:44:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:50,144 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2025-03-04 01:44:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2025-03-04 01:44:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:44:50,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:50,149 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:44:50,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:50,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2043745124, now seen corresponding path program 1 times [2025-03-04 01:44:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:50,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12270491] [2025-03-04 01:44:50,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:50,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:44:50,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:44:50,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:50,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12270491] [2025-03-04 01:44:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12270491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:44:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397859047] [2025-03-04 01:44:51,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:51,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:44:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:51,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:44:51,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:51,627 INFO L87 Difference]: Start difference. First operand 341 states and 476 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:52,674 INFO L93 Difference]: Finished difference Result 699 states and 970 transitions. [2025-03-04 01:44:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:44:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:52,677 INFO L225 Difference]: With dead ends: 699 [2025-03-04 01:44:52,677 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 01:44:52,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:44:52,679 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 61 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:52,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 952 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:44:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 01:44:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 353. [2025-03-04 01:44:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 298 states have (on average 1.3154362416107384) internal successors, (392), 300 states have internal predecessors, (392), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:44:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2025-03-04 01:44:52,703 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 160 [2025-03-04 01:44:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:52,703 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2025-03-04 01:44:52,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2025-03-04 01:44:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:44:52,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:52,707 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:44:52,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 382137573, now seen corresponding path program 1 times [2025-03-04 01:44:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659027766] [2025-03-04 01:44:52,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:52,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:44:52,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:44:52,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:52,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659027766] [2025-03-04 01:44:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659027766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:44:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927428715] [2025-03-04 01:44:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:44:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:54,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:44:54,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:44:54,115 INFO L87 Difference]: Start difference. First operand 353 states and 488 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:55,086 INFO L93 Difference]: Finished difference Result 813 states and 1119 transitions. [2025-03-04 01:44:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:44:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:44:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:55,091 INFO L225 Difference]: With dead ends: 813 [2025-03-04 01:44:55,091 INFO L226 Difference]: Without dead ends: 463 [2025-03-04 01:44:55,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:44:55,093 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 55 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:55,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 716 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:44:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-04 01:44:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2025-03-04 01:44:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 398 states have (on average 1.3190954773869348) internal successors, (525), 402 states have internal predecessors, (525), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:44:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 629 transitions. [2025-03-04 01:44:55,126 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 629 transitions. Word has length 160 [2025-03-04 01:44:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:55,129 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 629 transitions. [2025-03-04 01:44:55,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 629 transitions. [2025-03-04 01:44:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:44:55,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:55,130 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:55,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:44:55,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:55,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1124333313, now seen corresponding path program 1 times [2025-03-04 01:44:55,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:55,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686859827] [2025-03-04 01:44:55,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:55,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:55,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:44:55,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:44:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:55,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686859827] [2025-03-04 01:44:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686859827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:56,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:44:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048918066] [2025-03-04 01:44:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:56,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:44:56,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:56,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:44:56,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:44:56,786 INFO L87 Difference]: Start difference. First operand 459 states and 629 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:57,614 INFO L93 Difference]: Finished difference Result 1281 states and 1746 transitions. [2025-03-04 01:44:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:44:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:44:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:57,620 INFO L225 Difference]: With dead ends: 1281 [2025-03-04 01:44:57,621 INFO L226 Difference]: Without dead ends: 825 [2025-03-04 01:44:57,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:44:57,622 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 52 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:57,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1143 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:44:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-04 01:44:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 745. [2025-03-04 01:44:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 668 states have (on average 1.3218562874251496) internal successors, (883), 676 states have internal predecessors, (883), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 56 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:44:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1011 transitions. [2025-03-04 01:44:57,684 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1011 transitions. Word has length 160 [2025-03-04 01:44:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1011 transitions. [2025-03-04 01:44:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1011 transitions. [2025-03-04 01:44:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:44:57,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:57,689 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:44:57,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:57,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash -614934780, now seen corresponding path program 1 times [2025-03-04 01:44:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993391011] [2025-03-04 01:44:57,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:57,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:44:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:44:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993391011] [2025-03-04 01:44:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993391011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850133365] [2025-03-04 01:44:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:57,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:57,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:57,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:57,967 INFO L87 Difference]: Start difference. First operand 745 states and 1011 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:44:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:58,288 INFO L93 Difference]: Finished difference Result 1519 states and 2067 transitions. [2025-03-04 01:44:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-04 01:44:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:58,292 INFO L225 Difference]: With dead ends: 1519 [2025-03-04 01:44:58,292 INFO L226 Difference]: Without dead ends: 777 [2025-03-04 01:44:58,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:58,294 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:58,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:44:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-04 01:44:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-03-04 01:44:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 700 states have (on average 1.312857142857143) internal successors, (919), 708 states have internal predecessors, (919), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 56 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:44:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1047 transitions. [2025-03-04 01:44:58,328 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1047 transitions. Word has length 160 [2025-03-04 01:44:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:58,329 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1047 transitions. [2025-03-04 01:44:58,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:44:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1047 transitions. [2025-03-04 01:44:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:44:58,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:58,331 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:58,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:44:58,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:58,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash 892617029, now seen corresponding path program 1 times [2025-03-04 01:44:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951573385] [2025-03-04 01:44:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:58,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:44:58,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:44:58,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:58,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:44:59,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:59,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951573385] [2025-03-04 01:44:59,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951573385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:59,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:44:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927829832] [2025-03-04 01:44:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:59,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:44:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:59,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:44:59,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:44:59,354 INFO L87 Difference]: Start difference. First operand 777 states and 1047 transitions. Second operand has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:44:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:59,963 INFO L93 Difference]: Finished difference Result 1529 states and 2062 transitions. [2025-03-04 01:44:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:44:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:44:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:59,970 INFO L225 Difference]: With dead ends: 1529 [2025-03-04 01:44:59,970 INFO L226 Difference]: Without dead ends: 755 [2025-03-04 01:44:59,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:44:59,973 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 56 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:59,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 626 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:44:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-03-04 01:45:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 739. [2025-03-04 01:45:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 662 states have (on average 1.3081570996978853) internal successors, (866), 670 states have internal predecessors, (866), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 56 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:45:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 994 transitions. [2025-03-04 01:45:00,022 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 994 transitions. Word has length 160 [2025-03-04 01:45:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:00,022 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 994 transitions. [2025-03-04 01:45:00,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 994 transitions. [2025-03-04 01:45:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:45:00,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:00,025 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:00,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:45:00,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:00,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -952876030, now seen corresponding path program 1 times [2025-03-04 01:45:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050865816] [2025-03-04 01:45:00,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:00,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:00,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:45:00,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:45:00,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:00,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050865816] [2025-03-04 01:45:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050865816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:45:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984307602] [2025-03-04 01:45:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:00,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:45:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:00,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:45:00,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:00,637 INFO L87 Difference]: Start difference. First operand 739 states and 994 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:01,116 INFO L93 Difference]: Finished difference Result 1571 states and 2103 transitions. [2025-03-04 01:45:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:45:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-04 01:45:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:01,121 INFO L225 Difference]: With dead ends: 1571 [2025-03-04 01:45:01,121 INFO L226 Difference]: Without dead ends: 835 [2025-03-04 01:45:01,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:45:01,122 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 60 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:01,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 611 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:45:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-04 01:45:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 831. [2025-03-04 01:45:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 732 states have (on average 1.2882513661202186) internal successors, (943), 742 states have internal predecessors, (943), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:45:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1103 transitions. [2025-03-04 01:45:01,168 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1103 transitions. Word has length 160 [2025-03-04 01:45:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:01,168 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1103 transitions. [2025-03-04 01:45:01,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1103 transitions. [2025-03-04 01:45:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:45:01,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:01,170 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:01,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:45:01,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:01,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1729371868, now seen corresponding path program 1 times [2025-03-04 01:45:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:01,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159166087] [2025-03-04 01:45:01,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:01,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:45:01,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:45:01,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:01,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:01,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159166087] [2025-03-04 01:45:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159166087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:01,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:45:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092464977] [2025-03-04 01:45:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:01,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:01,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:01,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:45:01,415 INFO L87 Difference]: Start difference. First operand 831 states and 1103 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:01,671 INFO L93 Difference]: Finished difference Result 1659 states and 2203 transitions. [2025-03-04 01:45:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-04 01:45:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:01,675 INFO L225 Difference]: With dead ends: 1659 [2025-03-04 01:45:01,675 INFO L226 Difference]: Without dead ends: 831 [2025-03-04 01:45:01,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:45:01,677 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:01,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:45:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-04 01:45:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2025-03-04 01:45:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 732 states have (on average 1.28551912568306) internal successors, (941), 742 states have internal predecessors, (941), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:45:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1101 transitions. [2025-03-04 01:45:01,717 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1101 transitions. Word has length 160 [2025-03-04 01:45:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:01,718 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1101 transitions. [2025-03-04 01:45:01,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1101 transitions. [2025-03-04 01:45:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:45:01,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:01,719 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:45:01,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:01,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -767757851, now seen corresponding path program 1 times [2025-03-04 01:45:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408374010] [2025-03-04 01:45:01,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:01,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:45:01,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:45:01,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408374010] [2025-03-04 01:45:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408374010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:02,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:45:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354459609] [2025-03-04 01:45:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:45:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:02,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:45:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:45:02,758 INFO L87 Difference]: Start difference. First operand 831 states and 1101 transitions. Second operand has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:03,454 INFO L93 Difference]: Finished difference Result 1837 states and 2426 transitions. [2025-03-04 01:45:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:45:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:45:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:03,460 INFO L225 Difference]: With dead ends: 1837 [2025-03-04 01:45:03,460 INFO L226 Difference]: Without dead ends: 1009 [2025-03-04 01:45:03,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:45:03,462 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:03,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 695 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:45:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-04 01:45:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 869. [2025-03-04 01:45:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 770 states have (on average 1.2857142857142858) internal successors, (990), 780 states have internal predecessors, (990), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:45:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1150 transitions. [2025-03-04 01:45:03,525 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1150 transitions. Word has length 160 [2025-03-04 01:45:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:03,526 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1150 transitions. [2025-03-04 01:45:03,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.5) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1150 transitions. [2025-03-04 01:45:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:45:03,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:03,528 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:03,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:45:03,529 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:03,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1278292028, now seen corresponding path program 1 times [2025-03-04 01:45:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594584711] [2025-03-04 01:45:03,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:03,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:45:03,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:45:03,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:03,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594584711] [2025-03-04 01:45:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594584711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:45:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249851091] [2025-03-04 01:45:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:45:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:04,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:45:04,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:45:04,775 INFO L87 Difference]: Start difference. First operand 869 states and 1150 transitions. Second operand has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 01:45:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:05,930 INFO L93 Difference]: Finished difference Result 1914 states and 2515 transitions. [2025-03-04 01:45:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:45:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2025-03-04 01:45:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:05,934 INFO L225 Difference]: With dead ends: 1914 [2025-03-04 01:45:05,934 INFO L226 Difference]: Without dead ends: 1048 [2025-03-04 01:45:05,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:45:05,935 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 55 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:05,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 971 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:45:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-03-04 01:45:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 853. [2025-03-04 01:45:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 754 states have (on average 1.2811671087533156) internal successors, (966), 764 states have internal predecessors, (966), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:45:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1126 transitions. [2025-03-04 01:45:05,977 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1126 transitions. Word has length 160 [2025-03-04 01:45:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1126 transitions. [2025-03-04 01:45:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 01:45:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1126 transitions. [2025-03-04 01:45:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:45:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:05,979 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:05,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:45:05,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:05,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 393453700, now seen corresponding path program 1 times [2025-03-04 01:45:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269246436] [2025-03-04 01:45:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:06,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:45:06,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:45:06,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:06,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:07,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269246436] [2025-03-04 01:45:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269246436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:45:07,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768540794] [2025-03-04 01:45:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:07,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:45:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:07,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:45:07,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:45:07,044 INFO L87 Difference]: Start difference. First operand 853 states and 1126 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:08,158 INFO L93 Difference]: Finished difference Result 1803 states and 2371 transitions. [2025-03-04 01:45:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:45:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:45:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:08,164 INFO L225 Difference]: With dead ends: 1803 [2025-03-04 01:45:08,164 INFO L226 Difference]: Without dead ends: 953 [2025-03-04 01:45:08,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:45:08,167 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 60 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:08,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1002 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:45:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-04 01:45:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 870. [2025-03-04 01:45:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 766 states have (on average 1.2702349869451697) internal successors, (973), 776 states have internal predecessors, (973), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1141 transitions. [2025-03-04 01:45:08,231 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1141 transitions. Word has length 160 [2025-03-04 01:45:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:08,231 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1141 transitions. [2025-03-04 01:45:08,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1141 transitions. [2025-03-04 01:45:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 01:45:08,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:08,235 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:08,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:45:08,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:08,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash 903933156, now seen corresponding path program 1 times [2025-03-04 01:45:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563409017] [2025-03-04 01:45:08,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:08,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 01:45:08,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 01:45:08,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:08,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563409017] [2025-03-04 01:45:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563409017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:09,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:45:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44011071] [2025-03-04 01:45:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:09,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:45:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:09,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:45:09,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:45:09,283 INFO L87 Difference]: Start difference. First operand 870 states and 1141 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:10,396 INFO L93 Difference]: Finished difference Result 1763 states and 2312 transitions. [2025-03-04 01:45:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:45:10,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-03-04 01:45:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:10,401 INFO L225 Difference]: With dead ends: 1763 [2025-03-04 01:45:10,402 INFO L226 Difference]: Without dead ends: 896 [2025-03-04 01:45:10,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:45:10,405 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 55 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:10,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1124 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:45:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-04 01:45:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 845. [2025-03-04 01:45:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 741 states have (on average 1.2685560053981106) internal successors, (940), 751 states have internal predecessors, (940), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1108 transitions. [2025-03-04 01:45:10,456 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1108 transitions. Word has length 160 [2025-03-04 01:45:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:10,456 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1108 transitions. [2025-03-04 01:45:10,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1108 transitions. [2025-03-04 01:45:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:45:10,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:10,459 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:10,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:45:10,459 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:10,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 583349031, now seen corresponding path program 1 times [2025-03-04 01:45:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113953219] [2025-03-04 01:45:10,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:10,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113953219] [2025-03-04 01:45:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113953219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:12,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:12,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:45:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008939484] [2025-03-04 01:45:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:12,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:45:12,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:12,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:45:12,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:45:12,003 INFO L87 Difference]: Start difference. First operand 845 states and 1108 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:13,277 INFO L93 Difference]: Finished difference Result 2165 states and 2834 transitions. [2025-03-04 01:45:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:45:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-03-04 01:45:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:13,282 INFO L225 Difference]: With dead ends: 2165 [2025-03-04 01:45:13,282 INFO L226 Difference]: Without dead ends: 1323 [2025-03-04 01:45:13,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:45:13,284 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 234 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:13,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1294 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:45:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-03-04 01:45:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 906. [2025-03-04 01:45:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 802 states have (on average 1.268079800498753) internal successors, (1017), 812 states have internal predecessors, (1017), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1185 transitions. [2025-03-04 01:45:13,333 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1185 transitions. Word has length 162 [2025-03-04 01:45:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:13,333 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1185 transitions. [2025-03-04 01:45:13,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1185 transitions. [2025-03-04 01:45:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:45:13,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:13,335 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:13,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:45:13,335 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:13,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2090900840, now seen corresponding path program 1 times [2025-03-04 01:45:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:13,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770888429] [2025-03-04 01:45:13,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:13,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770888429] [2025-03-04 01:45:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770888429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:45:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702330995] [2025-03-04 01:45:14,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:14,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:45:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:45:14,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:45:14,307 INFO L87 Difference]: Start difference. First operand 906 states and 1185 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:14,895 INFO L93 Difference]: Finished difference Result 1958 states and 2553 transitions. [2025-03-04 01:45:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:45:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-03-04 01:45:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:14,899 INFO L225 Difference]: With dead ends: 1958 [2025-03-04 01:45:14,899 INFO L226 Difference]: Without dead ends: 1055 [2025-03-04 01:45:14,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:45:14,901 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 52 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:14,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 763 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:45:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-04 01:45:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 906. [2025-03-04 01:45:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 802 states have (on average 1.2581047381546135) internal successors, (1009), 812 states have internal predecessors, (1009), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1177 transitions. [2025-03-04 01:45:14,937 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1177 transitions. Word has length 162 [2025-03-04 01:45:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:14,938 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1177 transitions. [2025-03-04 01:45:14,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1177 transitions. [2025-03-04 01:45:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:45:14,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:14,939 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:14,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:45:14,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:14,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1828113512, now seen corresponding path program 1 times [2025-03-04 01:45:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230517944] [2025-03-04 01:45:14,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:14,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:14,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:14,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230517944] [2025-03-04 01:45:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230517944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:45:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786114161] [2025-03-04 01:45:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:16,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:45:16,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:16,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:45:16,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:45:16,598 INFO L87 Difference]: Start difference. First operand 906 states and 1177 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:17,883 INFO L93 Difference]: Finished difference Result 1966 states and 2551 transitions. [2025-03-04 01:45:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:45:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-03-04 01:45:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:17,888 INFO L225 Difference]: With dead ends: 1966 [2025-03-04 01:45:17,888 INFO L226 Difference]: Without dead ends: 1063 [2025-03-04 01:45:17,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:45:17,890 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:17,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1555 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:45:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-03-04 01:45:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 914. [2025-03-04 01:45:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 810 states have (on average 1.2604938271604937) internal successors, (1021), 820 states have internal predecessors, (1021), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1189 transitions. [2025-03-04 01:45:17,933 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1189 transitions. Word has length 162 [2025-03-04 01:45:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:17,934 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1189 transitions. [2025-03-04 01:45:17,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1189 transitions. [2025-03-04 01:45:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:45:17,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:17,935 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:45:17,935 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:17,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1276450728, now seen corresponding path program 1 times [2025-03-04 01:45:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690686745] [2025-03-04 01:45:17,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:17,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:17,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:17,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:17,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:18,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690686745] [2025-03-04 01:45:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690686745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:45:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157960005] [2025-03-04 01:45:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:45:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:18,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:45:18,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:18,668 INFO L87 Difference]: Start difference. First operand 914 states and 1189 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:18,984 INFO L93 Difference]: Finished difference Result 1769 states and 2303 transitions. [2025-03-04 01:45:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:45:18,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-03-04 01:45:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:18,989 INFO L225 Difference]: With dead ends: 1769 [2025-03-04 01:45:18,990 INFO L226 Difference]: Without dead ends: 858 [2025-03-04 01:45:18,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:18,992 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:18,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:45:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-04 01:45:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2025-03-04 01:45:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 754 states have (on average 1.2559681697612732) internal successors, (947), 764 states have internal predecessors, (947), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1115 transitions. [2025-03-04 01:45:19,032 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1115 transitions. Word has length 162 [2025-03-04 01:45:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:19,032 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1115 transitions. [2025-03-04 01:45:19,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1115 transitions. [2025-03-04 01:45:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:45:19,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:19,034 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:45:19,034 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1856844069, now seen corresponding path program 1 times [2025-03-04 01:45:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508692132] [2025-03-04 01:45:19,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:19,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:19,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:19,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 01:45:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:19,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508692132] [2025-03-04 01:45:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508692132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372752254] [2025-03-04 01:45:19,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:45:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:45:19,151 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:45:19,153 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:45:19,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:19,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:19,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:19,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:19,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:45:19,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:19,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372752254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:45:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:45:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798571389] [2025-03-04 01:45:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:19,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:19,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:19,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:45:19,412 INFO L87 Difference]: Start difference. First operand 858 states and 1115 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:19,471 INFO L93 Difference]: Finished difference Result 1749 states and 2275 transitions. [2025-03-04 01:45:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:19,472 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-03-04 01:45:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:19,475 INFO L225 Difference]: With dead ends: 1749 [2025-03-04 01:45:19,475 INFO L226 Difference]: Without dead ends: 894 [2025-03-04 01:45:19,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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:45:19,478 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:19,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:45:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-04 01:45:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2025-03-04 01:45:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 790 states have (on average 1.2443037974683544) internal successors, (983), 800 states have internal predecessors, (983), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1151 transitions. [2025-03-04 01:45:19,520 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1151 transitions. Word has length 162 [2025-03-04 01:45:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:19,521 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1151 transitions. [2025-03-04 01:45:19,521 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1151 transitions. [2025-03-04 01:45:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:45:19,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:19,522 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,530 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:45:19,723 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,SelfDestructingSolverStorable20 [2025-03-04 01:45:19,723 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash -223173657, now seen corresponding path program 1 times [2025-03-04 01:45:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579111813] [2025-03-04 01:45:19,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:19,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:45:19,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:45:19,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:19,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579111813] [2025-03-04 01:45:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579111813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:21,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:45:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625638675] [2025-03-04 01:45:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:21,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:45:21,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:21,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:45:21,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:45:21,218 INFO L87 Difference]: Start difference. First operand 894 states and 1151 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:23,083 INFO L93 Difference]: Finished difference Result 2211 states and 2832 transitions. [2025-03-04 01:45:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 01:45:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-03-04 01:45:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:23,090 INFO L225 Difference]: With dead ends: 2211 [2025-03-04 01:45:23,090 INFO L226 Difference]: Without dead ends: 1320 [2025-03-04 01:45:23,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1363, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 01:45:23,092 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 226 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:23,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1650 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:45:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-04 01:45:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 878. [2025-03-04 01:45:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 774 states have (on average 1.244186046511628) internal successors, (963), 784 states have internal predecessors, (963), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1131 transitions. [2025-03-04 01:45:23,127 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1131 transitions. Word has length 162 [2025-03-04 01:45:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:23,127 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1131 transitions. [2025-03-04 01:45:23,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 01:45:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1131 transitions. [2025-03-04 01:45:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:45:23,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:23,129 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:23,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:45:23,129 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1830930077, now seen corresponding path program 1 times [2025-03-04 01:45:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147851266] [2025-03-04 01:45:23,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:45:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:45:23,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147851266] [2025-03-04 01:45:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147851266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:23,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:23,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:45:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859758098] [2025-03-04 01:45:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:23,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:23,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:23,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:45:23,379 INFO L87 Difference]: Start difference. First operand 878 states and 1131 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:23,781 INFO L93 Difference]: Finished difference Result 2448 states and 3127 transitions. [2025-03-04 01:45:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:23,781 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-04 01:45:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:23,787 INFO L225 Difference]: With dead ends: 2448 [2025-03-04 01:45:23,787 INFO L226 Difference]: Without dead ends: 1573 [2025-03-04 01:45:23,788 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:45:23,789 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 102 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:23,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 290 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:45:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-04 01:45:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1113. [2025-03-04 01:45:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1009 states have (on average 1.2279484638255698) internal successors, (1239), 1019 states have internal predecessors, (1239), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 74 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:45:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1407 transitions. [2025-03-04 01:45:23,850 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1407 transitions. Word has length 164 [2025-03-04 01:45:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:23,850 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1407 transitions. [2025-03-04 01:45:23,850 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1407 transitions. [2025-03-04 01:45:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:45:23,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:23,853 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:23,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:45:23,853 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:23,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash 847126328, now seen corresponding path program 1 times [2025-03-04 01:45:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:23,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338861171] [2025-03-04 01:45:23,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:23,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:45:23,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:45:23,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:23,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:45:23,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:45:23,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:45:24,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:45:24,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:24,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:45:24,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:45:24,098 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:45:24,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:45:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:45:24,103 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] [2025-03-04 01:45:24,166 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:45:24,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:45:24 BoogieIcfgContainer [2025-03-04 01:45:24,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:45:24,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:45:24,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:45:24,172 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:45:24,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:41" (3/4) ... [2025-03-04 01:45:24,174 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:45:24,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:45:24,176 INFO L158 Benchmark]: Toolchain (without parser) took 43615.54ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 112.4MB in the beginning and 542.5MB in the end (delta: -430.0MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. [2025-03-04 01:45:24,176 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:45:24,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.61ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:45:24,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.47ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 91.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:45:24,177 INFO L158 Benchmark]: Boogie Preprocessor took 55.27ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:45:24,177 INFO L158 Benchmark]: IcfgBuilder took 704.29ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 54.1MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:45:24,177 INFO L158 Benchmark]: TraceAbstraction took 42515.76ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 53.2MB in the beginning and 542.6MB in the end (delta: -489.4MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. [2025-03-04 01:45:24,177 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 763.4MB. Free memory was 542.6MB in the beginning and 542.5MB in the end (delta: 159.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:45:24,180 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.23ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.61ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.47ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 91.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.27ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 704.29ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 54.1MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42515.76ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 53.2MB in the beginning and 542.6MB in the end (delta: -489.4MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 763.4MB. Free memory was 542.6MB in the beginning and 542.5MB in the end (delta: 159.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 113. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L58] signed short int last_1_WrapperStruct00_var_1_11 = -4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_8 [L116] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_11 [L117] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L90] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L93] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET updateVariables() [L129] CALL step() [L62] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L63] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L64] EXPR WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L64] EXPR WrapperStruct00.var_1_7 [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))) [L68] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L68] COND TRUE WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_10 [L69] EXPR WrapperStruct00.var_1_6 [L69] WrapperStruct00.var_1_8 = ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)) [L71] EXPR WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L71] COND TRUE ! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10) [L72] WrapperStruct00.var_1_16 = (32 - 8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L76] EXPR WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L77] EXPR WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L77] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) [L120] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) [L120] EXPR WrapperStruct00.var_1_17 [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120-L121] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.4s, OverallIterations: 24, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1485 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1455 mSDsluCounter, 18097 SdHoareTripleChecker+Invalid, 12.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14947 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12251 IncrementalHoareTripleChecker+Invalid, 12349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 3150 mSDtfsCounter, 12251 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1113occurred in iteration=23, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 2291 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 4148 NumberOfCodeBlocks, 4148 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3959 ConstructedInterpolants, 0 QuantifiedInterpolants, 11830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 18905/19000 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:45:24,271 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-s_file-84.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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:45:26,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:45:26,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:45:26,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:45:26,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:45:26,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:45:26,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:45:26,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:45:26,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:45:26,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:45:26,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:45:26,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:45:26,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:45:26,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:45:26,253 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:45:26,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:45:26,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:45:26,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:45:26,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:45:26,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:45:26,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:45:26,256 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2025-03-04 01:45:26,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:45:26,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:45:26,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:45:26,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:45:26,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:45:26,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-04 01:45:27,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acee6d0da/da524b85ef77417eaac69b73fd4bff46/FLAGd7064df32 [2025-03-04 01:45:27,954 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:45:27,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2025-03-04 01:45:27,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acee6d0da/da524b85ef77417eaac69b73fd4bff46/FLAGd7064df32 [2025-03-04 01:45:27,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acee6d0da/da524b85ef77417eaac69b73fd4bff46 [2025-03-04 01:45:27,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:45:27,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:45:27,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:45:27,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:45:27,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:45:27,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:45:27" (1/1) ... [2025-03-04 01:45:27,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44487ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:27, skipping insertion in model container [2025-03-04 01:45:27,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:45:27" (1/1) ... [2025-03-04 01:45:28,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:45:28,112 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-s_file-84.i[916,929] [2025-03-04 01:45:28,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:45:28,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:45:28,188 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-s_file-84.i[916,929] [2025-03-04 01:45:28,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:45:28,252 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:45:28,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28 WrapperNode [2025-03-04 01:45:28,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:45:28,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:45:28,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:45:28,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:45:28,258 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:45:28" (1/1) ... [2025-03-04 01:45:28,275 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:45:28" (1/1) ... [2025-03-04 01:45:28,306 INFO L138 Inliner]: procedures = 34, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2025-03-04 01:45:28,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:45:28,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:45:28,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:45:28,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:45:28,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,356 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-04 01:45:28,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:45:28,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:45:28,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:45:28,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:45:28,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (1/1) ... [2025-03-04 01:45:28,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:45:28,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:45:28,415 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:45:28,417 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:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:45:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:45:28,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:45:28,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:45:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:45:28,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:45:28,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:45:29,012 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem78#1;havoc property_#t~ite85#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1; [2025-03-04 01:45:29,057 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-04 01:45:29,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:45:29,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:45:29,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:45:29,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:45:29 BoogieIcfgContainer [2025-03-04 01:45:29,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:45:29,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:45:29,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:45:29,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:45:29,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:45:27" (1/3) ... [2025-03-04 01:45:29,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a86a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:45:29, skipping insertion in model container [2025-03-04 01:45:29,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:28" (2/3) ... [2025-03-04 01:45:29,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a86a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:45:29, skipping insertion in model container [2025-03-04 01:45:29,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:45:29" (3/3) ... [2025-03-04 01:45:29,076 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2025-03-04 01:45:29,086 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:45:29,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-84.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:45:29,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:45:29,134 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;@7d768132, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:45:29,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:45:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:45:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:45:29,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:29,149 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:29,156 INFO L85 PathProgramCache]: Analyzing trace with hash 785911346, now seen corresponding path program 1 times [2025-03-04 01:45:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836704423] [2025-03-04 01:45:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:29,166 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:45:29,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:29,169 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:45:29,171 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:45:29,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:45:29,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:45:29,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:29,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:29,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:45:29,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-04 01:45:29,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:29,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:29,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836704423] [2025-03-04 01:45:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836704423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:45:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042933471] [2025-03-04 01:45:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:45:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:29,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:45:29,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:45:29,477 INFO L87 Difference]: Start difference. First operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:29,506 INFO L93 Difference]: Finished difference Result 198 states and 307 transitions. [2025-03-04 01:45:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:45:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2025-03-04 01:45:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:29,512 INFO L225 Difference]: With dead ends: 198 [2025-03-04 01:45:29,513 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 01:45:29,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:45:29,518 INFO L435 NwaCegarLoop]: 141 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, 141 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:45:29,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:45:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 01:45:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-04 01:45:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:45:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-04 01:45:29,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2025-03-04 01:45:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:29,558 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-04 01:45:29,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 01:45:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-04 01:45:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:45:29,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:29,563 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,572 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:45:29,764 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:45:29,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:29,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 839864420, now seen corresponding path program 1 times [2025-03-04 01:45:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906592832] [2025-03-04 01:45:29,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:29,765 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:45:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:29,767 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:45:29,768 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:45:29,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:45:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:45:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:29,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:45:29,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:30,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:30,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:30,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906592832] [2025-03-04 01:45:30,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906592832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:30,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:30,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:45:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812397330] [2025-03-04 01:45:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:45:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:30,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:45:30,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:30,060 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:30,131 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-03-04 01:45:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:45:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-03-04 01:45:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:30,134 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:45:30,134 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:45:30,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:30,135 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:30,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:45:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:45:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-04 01:45:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:45:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2025-03-04 01:45:30,151 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 150 [2025-03-04 01:45:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:30,152 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2025-03-04 01:45:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2025-03-04 01:45:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:45:30,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:30,154 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:30,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:45:30,355 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:45:30,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:30,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash 840787941, now seen corresponding path program 1 times [2025-03-04 01:45:30,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634063543] [2025-03-04 01:45:30,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:30,356 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:45:30,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:30,358 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:45:30,358 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:45:30,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:45:30,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:45:30,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:30,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:30,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:45:30,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 90 [2025-03-04 01:45:30,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2025-03-04 01:45:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:45:31,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:31,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634063543] [2025-03-04 01:45:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634063543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:31,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:31,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:45:31,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304432233] [2025-03-04 01:45:31,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:31,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:31,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:45:31,104 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:32,397 INFO L93 Difference]: Finished difference Result 314 states and 439 transitions. [2025-03-04 01:45:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:32,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-03-04 01:45:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:32,402 INFO L225 Difference]: With dead ends: 314 [2025-03-04 01:45:32,402 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 01:45:32,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:45:32,403 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 75 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:32,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 477 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:45:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 01:45:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2025-03-04 01:45:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 133 states have (on average 1.255639097744361) internal successors, (167), 133 states have internal predecessors, (167), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:45:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2025-03-04 01:45:32,429 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 150 [2025-03-04 01:45:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:32,429 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2025-03-04 01:45:32,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 01:45:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2025-03-04 01:45:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:45:32,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:32,430 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:45:32,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:32,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2006131177, now seen corresponding path program 1 times [2025-03-04 01:45:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756977154] [2025-03-04 01:45:32,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:32,632 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:45:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:32,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:32,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:45:32,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:45:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:45:32,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:32,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 01:45:32,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:32,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:45:32,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:45:33,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-04 01:45:33,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:33,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 37 [2025-03-04 01:45:33,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:33,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2025-03-04 01:45:33,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:33,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-04 01:45:33,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:33,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-04 01:45:33,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-04 01:45:34,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:34,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:34,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90 [2025-03-04 01:45:34,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 115 treesize of output 114 [2025-03-04 01:45:34,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 127 [2025-03-04 01:45:35,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:35,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 135 treesize of output 131 [2025-03-04 01:45:35,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:35,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 145 treesize of output 65 [2025-03-04 01:45:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:45:35,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:35,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756977154] [2025-03-04 01:45:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756977154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:35,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:45:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638001100] [2025-03-04 01:45:35,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:35,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:45:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:35,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:45:35,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:45:35,599 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-04 01:45:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:38,464 INFO L93 Difference]: Finished difference Result 434 states and 601 transitions. [2025-03-04 01:45:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:45:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 158 [2025-03-04 01:45:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:38,468 INFO L225 Difference]: With dead ends: 434 [2025-03-04 01:45:38,468 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 01:45:38,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:45:38,469 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 498 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:38,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 509 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 01:45:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 01:45:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 203. [2025-03-04 01:45:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.2830188679245282) internal successors, (204), 159 states have internal predecessors, (204), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:45:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2025-03-04 01:45:38,502 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 158 [2025-03-04 01:45:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:38,502 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2025-03-04 01:45:38,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-04 01:45:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2025-03-04 01:45:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:45:38,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:38,504 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:38,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:45:38,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:38,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:38,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1794780264, now seen corresponding path program 1 times [2025-03-04 01:45:38,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:38,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784629334] [2025-03-04 01:45:38,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:38,705 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:45:38,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:38,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:38,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:45:38,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:45:38,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:45:38,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:38,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:38,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:45:38,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:38,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:45:39,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-03-04 01:45:39,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-03-04 01:45:39,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:39,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 37 [2025-03-04 01:45:39,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:39,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 37 [2025-03-04 01:45:39,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:39,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 49 [2025-03-04 01:45:39,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:39,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 82 [2025-03-04 01:45:39,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:39,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 46 [2025-03-04 01:45:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 468 proven. 48 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-04 01:45:40,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:40,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784629334] [2025-03-04 01:45:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784629334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636855087] [2025-03-04 01:45:40,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:40,109 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:45:40,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:45:40,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:45:40,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-04 01:45:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:45:40,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:45:40,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:40,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:40,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 01:45:40,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:40,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:45:41,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-04 01:45:41,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-04 01:45:41,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-03-04 01:45:41,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:41,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 33 [2025-03-04 01:45:41,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:41,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2025-03-04 01:45:41,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:41,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 74 [2025-03-04 01:45:41,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:41,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 46 [2025-03-04 01:45:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 480 proven. 48 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:45:41,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:42,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [636855087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:42,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:45:42,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2025-03-04 01:45:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673748445] [2025-03-04 01:45:42,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:45:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 01:45:42,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:42,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 01:45:42,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:45:42,038 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand has 28 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 10 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2025-03-04 01:45:46,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:46,521 INFO L93 Difference]: Finished difference Result 440 states and 583 transitions. [2025-03-04 01:45:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 01:45:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 10 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) Word has length 158 [2025-03-04 01:45:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:46,525 INFO L225 Difference]: With dead ends: 440 [2025-03-04 01:45:46,525 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 01:45:46,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 349 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=593, Invalid=1957, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 01:45:46,526 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 407 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:46,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 617 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 01:45:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 01:45:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 302. [2025-03-04 01:45:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 243 states have (on average 1.2386831275720165) internal successors, (301), 244 states have internal predecessors, (301), 44 states have call successors, (44), 14 states have call predecessors, (44), 14 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:45:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 389 transitions. [2025-03-04 01:45:46,574 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 389 transitions. Word has length 158 [2025-03-04 01:45:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:46,578 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 389 transitions. [2025-03-04 01:45:46,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 10 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2025-03-04 01:45:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 389 transitions. [2025-03-04 01:45:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:45:46,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:46,580 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:46,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-04 01:45:46,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:45:46,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:46,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -761366696, now seen corresponding path program 1 times [2025-03-04 01:45:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405113989] [2025-03-04 01:45:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:46,983 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:45:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:46,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:46,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:45:47,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:45:47,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:45:47,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:47,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:47,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 01:45:47,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:47,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:45:47,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:45:47,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-04 01:45:47,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:47,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 37 [2025-03-04 01:45:47,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:47,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-04 01:45:47,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:47,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-04 01:45:47,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:47,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2025-03-04 01:45:48,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:48,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2025-03-04 01:45:48,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:48,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 102 [2025-03-04 01:45:48,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:48,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 105 [2025-03-04 01:45:49,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:49,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 129 [2025-03-04 01:45:49,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 122 treesize of output 142 [2025-03-04 01:45:49,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:49,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 137 treesize of output 145 [2025-03-04 01:45:50,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 147 treesize of output 61 [2025-03-04 01:45:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:45:50,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:50,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405113989] [2025-03-04 01:45:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405113989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:45:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546784517] [2025-03-04 01:45:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:45:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:50,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:45:50,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:45:50,140 INFO L87 Difference]: Start difference. First operand 302 states and 389 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 9 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20)