./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.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 f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:57:41,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:57:41,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:57:41,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:57:41,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:57:41,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:57:41,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:57:41,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:57:41,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:57:41,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:57:41,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:57:41,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:57:41,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:57:41,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:57:41,438 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:57:41,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:57:41,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:57:41,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:57:41,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:57:41,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:57:41,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:57:41,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:57:41,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:57:41,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:57:41,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:57:41,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:57:41,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:57:41,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:57:41,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:57:41,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:57:41,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:57:41,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:57:41,441 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 -> f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe [2025-03-17 05:57:41,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:57:41,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:57:41,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:57:41,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:57:41,691 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:57:41,692 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-44.i [2025-03-17 05:57:42,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a92a3aff/448d35de26c2499abce2dd8520511f2b/FLAG47446e3b5 [2025-03-17 05:57:43,025 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:57:43,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2025-03-17 05:57:43,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a92a3aff/448d35de26c2499abce2dd8520511f2b/FLAG47446e3b5 [2025-03-17 05:57:43,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a92a3aff/448d35de26c2499abce2dd8520511f2b [2025-03-17 05:57:43,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:57:43,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:57:43,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:57:43,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:57:43,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:57:43,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43, skipping insertion in model container [2025-03-17 05:57:43,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:57:43,446 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-44.i[916,929] [2025-03-17 05:57:43,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:57:43,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:57:43,492 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-44.i[916,929] [2025-03-17 05:57:43,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:57:43,535 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:57:43,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43 WrapperNode [2025-03-17 05:57:43,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:57:43,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:57:43,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:57:43,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:57:43,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,577 INFO L138 Inliner]: procedures = 30, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2025-03-17 05:57:43,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:57:43,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:57:43,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:57:43,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:57:43,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,591 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:57:43,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:57:43,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:57:43,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:57:43,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:57:43,611 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (1/1) ... [2025-03-17 05:57:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:57:43,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:43,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:57:43,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:57:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:57:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:57:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:57:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:57:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:57:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:57:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:57:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:57:43,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:57:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:57:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:57:43,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:57:43,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:57:43,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:57:44,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~ite115#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short116#1;havoc property_#t~mem121#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~short129#1;havoc property_#t~short130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-17 05:57:44,160 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 05:57:44,161 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:57:44,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:57:44,169 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:57:44,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:57:44 BoogieIcfgContainer [2025-03-17 05:57:44,169 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:57:44,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:57:44,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:57:44,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:57:44,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:57:43" (1/3) ... [2025-03-17 05:57:44,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a13c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:57:44, skipping insertion in model container [2025-03-17 05:57:44,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:43" (2/3) ... [2025-03-17 05:57:44,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a13c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:57:44, skipping insertion in model container [2025-03-17 05:57:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:57:44" (3/3) ... [2025-03-17 05:57:44,177 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-44.i [2025-03-17 05:57:44,188 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:57:44,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-44.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:57:44,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:57:44,237 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;@f87587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:57:44,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:57:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:57:44,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:44,250 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:44,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 345975356, now seen corresponding path program 1 times [2025-03-17 05:57:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:44,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464512880] [2025-03-17 05:57:44,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:44,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:57:44,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:57:44,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:44,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 05:57:44,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464512880] [2025-03-17 05:57:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464512880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204559794] [2025-03-17 05:57:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:44,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:44,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:44,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:44,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:57:44,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:57:44,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:57:44,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:44,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:44,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:57:44,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 05:57:44,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204559794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:57:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715165728] [2025-03-17 05:57:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:44,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:57:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:44,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:57:44,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:57:44,805 INFO L87 Difference]: Start difference. First operand has 112 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:44,825 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2025-03-17 05:57:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:57:44,827 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2025-03-17 05:57:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:44,833 INFO L225 Difference]: With dead ends: 221 [2025-03-17 05:57:44,833 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:57:44,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:57:44,837 INFO L435 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:44,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:57:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 05:57:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-03-17 05:57:44,864 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 155 [2025-03-17 05:57:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:44,865 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-03-17 05:57:44,865 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-03-17 05:57:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:57:44,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:44,867 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:44,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:57:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:57:45,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:45,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 641505955, now seen corresponding path program 1 times [2025-03-17 05:57:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719065363] [2025-03-17 05:57:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:45,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:57:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:57:45,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:45,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719065363] [2025-03-17 05:57:45,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719065363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:45,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:45,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:57:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11239996] [2025-03-17 05:57:45,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:45,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:45,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:45,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:57:45,369 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:45,406 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2025-03-17 05:57:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2025-03-17 05:57:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:45,409 INFO L225 Difference]: With dead ends: 221 [2025-03-17 05:57:45,409 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:57:45,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:57:45,410 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:45,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:57:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 05:57:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2025-03-17 05:57:45,419 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 155 [2025-03-17 05:57:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2025-03-17 05:57:45,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2025-03-17 05:57:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:57:45,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:45,422 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:57:45,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -225546270, now seen corresponding path program 1 times [2025-03-17 05:57:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498153003] [2025-03-17 05:57:45,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:45,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:57:45,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:57:45,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:45,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498153003] [2025-03-17 05:57:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498153003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:57:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027855358] [2025-03-17 05:57:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:45,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:57:45,636 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:45,669 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2025-03-17 05:57:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2025-03-17 05:57:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:45,671 INFO L225 Difference]: With dead ends: 226 [2025-03-17 05:57:45,671 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 05:57:45,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:57:45,672 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 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-17 05:57:45,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 05:57:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-17 05:57:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2025-03-17 05:57:45,678 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 155 [2025-03-17 05:57:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:45,679 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2025-03-17 05:57:45,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2025-03-17 05:57:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:57:45,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:45,680 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:45,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:57:45,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:45,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash -224622749, now seen corresponding path program 1 times [2025-03-17 05:57:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:45,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888227146] [2025-03-17 05:57:45,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:45,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:57:45,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:57:45,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:46,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888227146] [2025-03-17 05:57:46,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888227146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:46,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:46,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:57:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777106973] [2025-03-17 05:57:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:46,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:57:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:46,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:57:46,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:57:46,290 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:46,550 INFO L93 Difference]: Finished difference Result 280 states and 405 transitions. [2025-03-17 05:57:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:57:46,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2025-03-17 05:57:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:46,553 INFO L225 Difference]: With dead ends: 280 [2025-03-17 05:57:46,553 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 05:57:46,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-17 05:57:46,554 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 62 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:46,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 536 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:57:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 05:57:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 132. [2025-03-17 05:57:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2025-03-17 05:57:46,567 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 155 [2025-03-17 05:57:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:46,567 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2025-03-17 05:57:46,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2025-03-17 05:57:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:57:46,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:46,569 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:46,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:57:46,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1187572752, now seen corresponding path program 1 times [2025-03-17 05:57:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:46,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56848696] [2025-03-17 05:57:46,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:46,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:57:46,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:57:46,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:48,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:48,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56848696] [2025-03-17 05:57:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56848696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:48,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:48,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:57:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165627434] [2025-03-17 05:57:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:48,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:57:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:48,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:57:48,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:57:48,142 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:48,587 INFO L93 Difference]: Finished difference Result 306 states and 440 transitions. [2025-03-17 05:57:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:57:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2025-03-17 05:57:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:48,590 INFO L225 Difference]: With dead ends: 306 [2025-03-17 05:57:48,590 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 05:57:48,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:57:48,591 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 69 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:48,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 737 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:57:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 05:57:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2025-03-17 05:57:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.36986301369863) internal successors, (200), 147 states have internal predecessors, (200), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:57:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 246 transitions. [2025-03-17 05:57:48,611 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 246 transitions. Word has length 156 [2025-03-17 05:57:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:48,611 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 246 transitions. [2025-03-17 05:57:48,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 246 transitions. [2025-03-17 05:57:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 05:57:48,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:48,613 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:57:48,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -214039750, now seen corresponding path program 1 times [2025-03-17 05:57:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:48,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719533209] [2025-03-17 05:57:48,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:48,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 05:57:48,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 05:57:48,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:48,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 05:57:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719533209] [2025-03-17 05:57:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719533209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861783287] [2025-03-17 05:57:48,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:48,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:48,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:57:48,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 05:57:48,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 05:57:48,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:48,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:48,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:57:48,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:49,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861783287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:49,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:49,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:57:49,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164448791] [2025-03-17 05:57:49,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:49,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:57:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:49,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:57:49,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:57:49,011 INFO L87 Difference]: Start difference. First operand 172 states and 246 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:49,039 INFO L93 Difference]: Finished difference Result 349 states and 499 transitions. [2025-03-17 05:57:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:57:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2025-03-17 05:57:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:49,042 INFO L225 Difference]: With dead ends: 349 [2025-03-17 05:57:49,042 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 05:57:49,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 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-17 05:57:49,043 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 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-17 05:57:49,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 05:57:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-17 05:57:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 152 states have (on average 1.355263157894737) internal successors, (206), 153 states have internal predecessors, (206), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:57:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2025-03-17 05:57:49,051 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 157 [2025-03-17 05:57:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:49,052 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2025-03-17 05:57:49,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2025-03-17 05:57:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:57:49,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:49,053 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:49,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:57:49,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 05:57:49,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 930567135, now seen corresponding path program 1 times [2025-03-17 05:57:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:49,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267708774] [2025-03-17 05:57:49,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:49,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:57:49,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:57:49,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:49,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267708774] [2025-03-17 05:57:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267708774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:57:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987667277] [2025-03-17 05:57:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:50,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:57:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:57:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:57:50,440 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:50,932 INFO L93 Difference]: Finished difference Result 356 states and 499 transitions. [2025-03-17 05:57:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:57:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2025-03-17 05:57:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:50,935 INFO L225 Difference]: With dead ends: 356 [2025-03-17 05:57:50,935 INFO L226 Difference]: Without dead ends: 179 [2025-03-17 05:57:50,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:57:50,936 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 61 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:50,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 587 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:57:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-17 05:57:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2025-03-17 05:57:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2025-03-17 05:57:50,946 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 196 transitions. Word has length 159 [2025-03-17 05:57:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:50,947 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 196 transitions. [2025-03-17 05:57:50,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2025-03-17 05:57:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:57:50,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:50,949 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:57:50,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:50,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1516912732, now seen corresponding path program 1 times [2025-03-17 05:57:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162679539] [2025-03-17 05:57:50,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:50,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:57:50,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:57:50,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:50,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162679539] [2025-03-17 05:57:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162679539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:57:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528009368] [2025-03-17 05:57:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:57:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:57:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:57:51,058 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:51,072 INFO L93 Difference]: Finished difference Result 277 states and 391 transitions. [2025-03-17 05:57:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:57:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2025-03-17 05:57:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:51,076 INFO L225 Difference]: With dead ends: 277 [2025-03-17 05:57:51,076 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 05:57:51,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:57:51,077 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:51,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 05:57:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-17 05:57:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:57:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2025-03-17 05:57:51,086 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 159 [2025-03-17 05:57:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:51,086 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2025-03-17 05:57:51,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2025-03-17 05:57:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:57:51,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:51,087 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:51,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:57:51,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:51,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash 542611980, now seen corresponding path program 1 times [2025-03-17 05:57:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:51,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320246066] [2025-03-17 05:57:51,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:51,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:57:51,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:57:51,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320246066] [2025-03-17 05:57:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320246066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:57:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973516806] [2025-03-17 05:57:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:51,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:51,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:57:51,972 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:52,160 INFO L93 Difference]: Finished difference Result 415 states and 583 transitions. [2025-03-17 05:57:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2025-03-17 05:57:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:52,163 INFO L225 Difference]: With dead ends: 415 [2025-03-17 05:57:52,164 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 05:57:52,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:57:52,165 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:52,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 274 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:57:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 05:57:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2025-03-17 05:57:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:57:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 368 transitions. [2025-03-17 05:57:52,181 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 368 transitions. Word has length 160 [2025-03-17 05:57:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:52,182 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 368 transitions. [2025-03-17 05:57:52,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2025-03-17 05:57:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 05:57:52,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:52,183 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:52,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:57:52,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:52,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash 289570929, now seen corresponding path program 1 times [2025-03-17 05:57:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:52,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383399962] [2025-03-17 05:57:52,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 05:57:52,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 05:57:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383399962] [2025-03-17 05:57:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383399962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:52,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:57:52,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45951943] [2025-03-17 05:57:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:52,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:52,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:57:52,277 INFO L87 Difference]: Start difference. First operand 263 states and 368 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:52,421 INFO L93 Difference]: Finished difference Result 527 states and 737 transitions. [2025-03-17 05:57:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:52,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2025-03-17 05:57:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:52,423 INFO L225 Difference]: With dead ends: 527 [2025-03-17 05:57:52,423 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 05:57:52,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:57:52,424 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:52,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 401 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:57:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 05:57:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-03-17 05:57:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:57:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 364 transitions. [2025-03-17 05:57:52,451 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 364 transitions. Word has length 161 [2025-03-17 05:57:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:52,451 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 364 transitions. [2025-03-17 05:57:52,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:57:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 364 transitions. [2025-03-17 05:57:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:57:52,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:52,453 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:57:52,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1599746775, now seen corresponding path program 1 times [2025-03-17 05:57:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27328621] [2025-03-17 05:57:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:57:52,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:57:52,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:52,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:57:53,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:53,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27328621] [2025-03-17 05:57:53,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27328621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:53,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:53,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:57:53,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330875756] [2025-03-17 05:57:53,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:53,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:57:53,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:53,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:57:53,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:53,489 INFO L87 Difference]: Start difference. First operand 263 states and 364 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:54,325 INFO L93 Difference]: Finished difference Result 680 states and 931 transitions. [2025-03-17 05:57:54,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:57:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2025-03-17 05:57:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:54,329 INFO L225 Difference]: With dead ends: 680 [2025-03-17 05:57:54,329 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 05:57:54,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:57:54,330 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 76 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:54,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1227 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:57:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 05:57:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 409. [2025-03-17 05:57:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 342 states have (on average 1.286549707602339) internal successors, (440), 344 states have internal predecessors, (440), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:57:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 556 transitions. [2025-03-17 05:57:54,361 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 556 transitions. Word has length 162 [2025-03-17 05:57:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:54,362 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 556 transitions. [2025-03-17 05:57:54,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:57:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 556 transitions. [2025-03-17 05:57:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:57:54,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:54,364 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:54,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:57:54,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:54,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 618011178, now seen corresponding path program 1 times [2025-03-17 05:57:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595119134] [2025-03-17 05:57:54,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:54,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:57:54,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:57:54,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:54,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595119134] [2025-03-17 05:58:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595119134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:58:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425739065] [2025-03-17 05:58:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:58:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:41,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:58:41,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:58:41,437 INFO L87 Difference]: Start difference. First operand 409 states and 556 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:58:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:42,793 INFO L93 Difference]: Finished difference Result 957 states and 1302 transitions. [2025-03-17 05:58:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:58:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2025-03-17 05:58:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:42,796 INFO L225 Difference]: With dead ends: 957 [2025-03-17 05:58:42,796 INFO L226 Difference]: Without dead ends: 549 [2025-03-17 05:58:42,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:58:42,797 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 77 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:42,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1033 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:58:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-17 05:58:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 447. [2025-03-17 05:58:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 380 states have (on average 1.3) internal successors, (494), 382 states have internal predecessors, (494), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:58:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 610 transitions. [2025-03-17 05:58:42,816 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 610 transitions. Word has length 162 [2025-03-17 05:58:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:42,816 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 610 transitions. [2025-03-17 05:58:42,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:58:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 610 transitions. [2025-03-17 05:58:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:58:42,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:42,818 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:58:42,819 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1123569803, now seen corresponding path program 1 times [2025-03-17 05:58:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468820651] [2025-03-17 05:58:42,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:42,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:58:42,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:58:42,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:42,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:43,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:43,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468820651] [2025-03-17 05:58:43,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468820651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:43,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:43,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:58:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406916527] [2025-03-17 05:58:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:43,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:43,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:43,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:43,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:43,708 INFO L87 Difference]: Start difference. First operand 447 states and 610 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:44,184 INFO L93 Difference]: Finished difference Result 1085 states and 1474 transitions. [2025-03-17 05:58:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2025-03-17 05:58:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:44,187 INFO L225 Difference]: With dead ends: 1085 [2025-03-17 05:58:44,187 INFO L226 Difference]: Without dead ends: 639 [2025-03-17 05:58:44,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:58:44,189 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 56 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:44,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 542 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:58:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-17 05:58:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 475. [2025-03-17 05:58:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 408 states have (on average 1.2990196078431373) internal successors, (530), 410 states have internal predecessors, (530), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:58:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 646 transitions. [2025-03-17 05:58:44,206 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 646 transitions. Word has length 162 [2025-03-17 05:58:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:44,206 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 646 transitions. [2025-03-17 05:58:44,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 646 transitions. [2025-03-17 05:58:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:58:44,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:44,208 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:58:44,208 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash 872747723, now seen corresponding path program 1 times [2025-03-17 05:58:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119990963] [2025-03-17 05:58:44,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:44,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:58:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:58:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:45,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119990963] [2025-03-17 05:58:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119990963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:58:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779469854] [2025-03-17 05:58:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:45,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:45,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:45,066 INFO L87 Difference]: Start difference. First operand 475 states and 646 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:45,432 INFO L93 Difference]: Finished difference Result 1113 states and 1506 transitions. [2025-03-17 05:58:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2025-03-17 05:58:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:45,436 INFO L225 Difference]: With dead ends: 1113 [2025-03-17 05:58:45,436 INFO L226 Difference]: Without dead ends: 639 [2025-03-17 05:58:45,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:58:45,438 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 57 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:45,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 679 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:58:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-17 05:58:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 475. [2025-03-17 05:58:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 408 states have (on average 1.2892156862745099) internal successors, (526), 410 states have internal predecessors, (526), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:58:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 642 transitions. [2025-03-17 05:58:45,457 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 642 transitions. Word has length 162 [2025-03-17 05:58:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:45,458 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 642 transitions. [2025-03-17 05:58:45,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 642 transitions. [2025-03-17 05:58:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:58:45,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:45,460 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:45,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:58:45,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1378306348, now seen corresponding path program 1 times [2025-03-17 05:58:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893668568] [2025-03-17 05:58:45,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:45,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:58:45,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:58:45,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:47,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:47,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893668568] [2025-03-17 05:58:47,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893668568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:58:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92348529] [2025-03-17 05:58:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:47,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:58:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:47,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:58:47,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:58:47,155 INFO L87 Difference]: Start difference. First operand 475 states and 642 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 05:58:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:48,630 INFO L93 Difference]: Finished difference Result 1051 states and 1414 transitions. [2025-03-17 05:58:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:58:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 162 [2025-03-17 05:58:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:48,634 INFO L225 Difference]: With dead ends: 1051 [2025-03-17 05:58:48,634 INFO L226 Difference]: Without dead ends: 577 [2025-03-17 05:58:48,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:58:48,635 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 80 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1296 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 05:58:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-17 05:58:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 465. [2025-03-17 05:58:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 398 states have (on average 1.2864321608040201) internal successors, (512), 400 states have internal predecessors, (512), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:58:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 628 transitions. [2025-03-17 05:58:48,653 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 628 transitions. Word has length 162 [2025-03-17 05:58:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:48,654 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 628 transitions. [2025-03-17 05:58:48,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 05:58:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 628 transitions. [2025-03-17 05:58:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:58:48,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:48,655 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:48,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:58:48,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:48,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1763637668, now seen corresponding path program 1 times [2025-03-17 05:58:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398136508] [2025-03-17 05:58:48,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:48,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:58:48,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:58:48,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:48,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398136508] [2025-03-17 05:58:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398136508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:58:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761282900] [2025-03-17 05:58:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:58:49,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:49,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:58:49,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:58:49,556 INFO L87 Difference]: Start difference. First operand 465 states and 628 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 05:58:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:50,040 INFO L93 Difference]: Finished difference Result 1217 states and 1618 transitions. [2025-03-17 05:58:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:58:50,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 163 [2025-03-17 05:58:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:50,044 INFO L225 Difference]: With dead ends: 1217 [2025-03-17 05:58:50,044 INFO L226 Difference]: Without dead ends: 753 [2025-03-17 05:58:50,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:58:50,045 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:50,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 908 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:58:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-03-17 05:58:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 725. [2025-03-17 05:58:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 612 states have (on average 1.2483660130718954) internal successors, (764), 618 states have internal predecessors, (764), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 05:58:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 956 transitions. [2025-03-17 05:58:50,113 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 956 transitions. Word has length 163 [2025-03-17 05:58:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:50,113 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 956 transitions. [2025-03-17 05:58:50,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 05:58:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 956 transitions. [2025-03-17 05:58:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:58:50,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:50,115 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:58:50,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1288446985, now seen corresponding path program 1 times [2025-03-17 05:58:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657295027] [2025-03-17 05:58:50,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:50,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:58:50,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:58:50,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:50,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657295027] [2025-03-17 05:58:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657295027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:58:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832180029] [2025-03-17 05:58:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:58:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:51,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:58:51,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:58:51,120 INFO L87 Difference]: Start difference. First operand 725 states and 956 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:51,304 INFO L93 Difference]: Finished difference Result 1481 states and 1957 transitions. [2025-03-17 05:58:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:58:51,306 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2025-03-17 05:58:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:51,309 INFO L225 Difference]: With dead ends: 1481 [2025-03-17 05:58:51,309 INFO L226 Difference]: Without dead ends: 757 [2025-03-17 05:58:51,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:51,311 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 90 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:51,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 307 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:58:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-17 05:58:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 725. [2025-03-17 05:58:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 612 states have (on average 1.2418300653594772) internal successors, (760), 618 states have internal predecessors, (760), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 05:58:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 952 transitions. [2025-03-17 05:58:51,341 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 952 transitions. Word has length 163 [2025-03-17 05:58:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 952 transitions. [2025-03-17 05:58:51,342 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 952 transitions. [2025-03-17 05:58:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:58:51,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:51,343 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:51,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:58:51,344 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:51,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1686857757, now seen corresponding path program 1 times [2025-03-17 05:58:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801541899] [2025-03-17 05:58:51,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:51,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:58:51,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:58:51,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:51,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:58:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820819599] [2025-03-17 05:58:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:58:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:58:51,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:58:51,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:58:51,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:58:51,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:58:51,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:51,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:51,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 05:58:51,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:51,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:58:52,035 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 26 treesize of output 14 [2025-03-17 05:58:52,079 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 26 treesize of output 14 [2025-03-17 05:58:52,141 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 26 treesize of output 14 [2025-03-17 05:58:52,187 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 26 treesize of output 14 [2025-03-17 05:58:52,239 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 26 treesize of output 14 [2025-03-17 05:58:52,283 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 26 treesize of output 14 [2025-03-17 05:58:52,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:52,355 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 26 treesize of output 28 [2025-03-17 05:58:52,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:52,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 05:58:52,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:52,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 66 [2025-03-17 05:58:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-17 05:58:52,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:58:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801541899] [2025-03-17 05:58:53,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:58:53,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820819599] [2025-03-17 05:58:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820819599] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:58:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:58:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2025-03-17 05:58:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128103684] [2025-03-17 05:58:53,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:53,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:53,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:53,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:58:53,968 INFO L87 Difference]: Start difference. First operand 725 states and 952 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:55,398 INFO L93 Difference]: Finished difference Result 1559 states and 2035 transitions. [2025-03-17 05:58:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:55,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2025-03-17 05:58:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:55,402 INFO L225 Difference]: With dead ends: 1559 [2025-03-17 05:58:55,402 INFO L226 Difference]: Without dead ends: 835 [2025-03-17 05:58:55,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:58:55,404 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 104 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:55,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 556 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:58:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-17 05:58:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 831. [2025-03-17 05:58:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 700 states have (on average 1.23) internal successors, (861), 708 states have internal predecessors, (861), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 100 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 05:58:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1077 transitions. [2025-03-17 05:58:55,468 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1077 transitions. Word has length 163 [2025-03-17 05:58:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1077 transitions. [2025-03-17 05:58:55,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1077 transitions. [2025-03-17 05:58:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 05:58:55,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:55,470 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:55,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:58:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 05:58:55,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:55,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1555920824, now seen corresponding path program 1 times [2025-03-17 05:58:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:55,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79760347] [2025-03-17 05:58:55,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:55,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 05:58:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 05:58:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:55,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79760347] [2025-03-17 05:58:55,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79760347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:55,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:58:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811911795] [2025-03-17 05:58:55,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:58:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:55,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:58:55,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:55,888 INFO L87 Difference]: Start difference. First operand 831 states and 1077 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:56,137 INFO L93 Difference]: Finished difference Result 1703 states and 2218 transitions. [2025-03-17 05:58:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:56,138 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2025-03-17 05:58:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:56,142 INFO L225 Difference]: With dead ends: 1703 [2025-03-17 05:58:56,142 INFO L226 Difference]: Without dead ends: 1213 [2025-03-17 05:58:56,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-17 05:58:56,145 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:56,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:58:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-17 05:58:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1176. [2025-03-17 05:58:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 987 states have (on average 1.2259371833839918) internal successors, (1210), 998 states have internal predecessors, (1210), 156 states have call successors, (156), 32 states have call predecessors, (156), 32 states have return successors, (156), 145 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-17 05:58:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1522 transitions. [2025-03-17 05:58:56,193 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1522 transitions. Word has length 165 [2025-03-17 05:58:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:56,194 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1522 transitions. [2025-03-17 05:58:56,194 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1522 transitions. [2025-03-17 05:58:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 05:58:56,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:56,195 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:58:56,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash -618511806, now seen corresponding path program 1 times [2025-03-17 05:58:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641459431] [2025-03-17 05:58:56,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:56,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 05:58:56,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 05:58:56,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:56,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641459431] [2025-03-17 05:58:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641459431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:58:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506981615] [2025-03-17 05:58:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:56,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:58:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:56,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:58:56,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:56,400 INFO L87 Difference]: Start difference. First operand 1176 states and 1522 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:56,681 INFO L93 Difference]: Finished difference Result 2048 states and 2658 transitions. [2025-03-17 05:58:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:56,682 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2025-03-17 05:58:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:56,686 INFO L225 Difference]: With dead ends: 2048 [2025-03-17 05:58:56,686 INFO L226 Difference]: Without dead ends: 1213 [2025-03-17 05:58:56,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-17 05:58:56,688 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 132 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:56,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 436 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:58:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-17 05:58:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 836. [2025-03-17 05:58:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 705 states have (on average 1.2283687943262411) internal successors, (866), 713 states have internal predecessors, (866), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 100 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 05:58:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1082 transitions. [2025-03-17 05:58:56,735 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1082 transitions. Word has length 167 [2025-03-17 05:58:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:56,735 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1082 transitions. [2025-03-17 05:58:56,735 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1082 transitions. [2025-03-17 05:58:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 05:58:56,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:56,736 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:56,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:58:56,737 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:56,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -570546150, now seen corresponding path program 1 times [2025-03-17 05:58:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:56,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029889420] [2025-03-17 05:58:56,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:56,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 05:58:56,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 05:58:56,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:56,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:58:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:58:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029889420] [2025-03-17 05:58:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029889420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:56,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:58:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106681889] [2025-03-17 05:58:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:58:56,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:56,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:56,990 INFO L87 Difference]: Start difference. First operand 836 states and 1082 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:57,519 INFO L93 Difference]: Finished difference Result 1778 states and 2321 transitions. [2025-03-17 05:58:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:58:57,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2025-03-17 05:58:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:57,524 INFO L225 Difference]: With dead ends: 1778 [2025-03-17 05:58:57,524 INFO L226 Difference]: Without dead ends: 943 [2025-03-17 05:58:57,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:57,526 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 294 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:57,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 418 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:58:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-17 05:58:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 906. [2025-03-17 05:58:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 756 states have (on average 1.2328042328042328) internal successors, (932), 763 states have internal predecessors, (932), 125 states have call successors, (125), 24 states have call predecessors, (125), 24 states have return successors, (125), 118 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-17 05:58:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1182 transitions. [2025-03-17 05:58:57,573 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1182 transitions. Word has length 167 [2025-03-17 05:58:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:57,573 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1182 transitions. [2025-03-17 05:58:57,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:58:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1182 transitions. [2025-03-17 05:58:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-17 05:58:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:57,574 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:58:57,575 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1813428793, now seen corresponding path program 1 times [2025-03-17 05:58:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:58:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724960236] [2025-03-17 05:58:57,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:58:57,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 05:58:57,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 05:58:57,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:57,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:58:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907951658] [2025-03-17 05:58:57,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:57,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:58:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:58:57,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:58:57,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:58:57,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 05:58:58,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 05:58:58,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:58,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:58:58,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:58:58,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 05:58:59,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 05:58:59,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:59,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:58:59,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:58:59,239 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:58:59,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:58:59,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:58:59,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:58:59,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:59,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:58:59,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:58:59 BoogieIcfgContainer [2025-03-17 05:58:59,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:58:59,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:58:59,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:58:59,486 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:58:59,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:57:44" (3/4) ... [2025-03-17 05:58:59,490 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:58:59,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:58:59,491 INFO L158 Benchmark]: Toolchain (without parser) took 76143.22ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 104.3MB in the beginning and 371.0MB in the end (delta: -266.7MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2025-03-17 05:58:59,491 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:58:59,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.84ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 88.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:58:59,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.11ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 83.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:58:59,491 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 80.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:58:59,491 INFO L158 Benchmark]: IcfgBuilder took 559.35ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 47.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:58:59,492 INFO L158 Benchmark]: TraceAbstraction took 75314.54ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 47.1MB in the beginning and 371.2MB in the end (delta: -324.1MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-03-17 05:58:59,492 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 545.3MB. Free memory was 371.2MB in the beginning and 371.0MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:58:59,495 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.84ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 88.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.11ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 83.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 80.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 559.35ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 47.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75314.54ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 47.1MB in the beginning and 371.2MB in the end (delta: -324.1MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 545.3MB. Free memory was 371.2MB in the beginning and 371.0MB in the end (delta: 175.4kB). 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 70, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someUnaryFLOAToperation at line 122, overapproximation of someUnaryFLOAToperation at line 70. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 32, -25, -64, -1, 50, 1, 0, 0, 1, 10.5, 0, 0, 0, 50.75, 32.6 }; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_7 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_7 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_19 [L117] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_19 [L117] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) [L60] EXPR WrapperStruct00.var_1_3 [L60] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR WrapperStruct00.var_1_7 [L60] signed long int stepLocal_1 = ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7; [L61] EXPR WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_6 [L61] signed long int stepLocal_0 = WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6; [L62] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=52, stepLocal_1=51] [L62] COND FALSE !(WrapperStruct00.var_1_4 > stepLocal_0) [L67] EXPR WrapperStruct00.var_1_3 [L67] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_3 [L69] EXPR WrapperStruct00.var_1_19 [L69] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51] [L70] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) [L70] EXPR WrapperStruct00.var_1_18 [L70] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51] [L70] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51] [L70] COND TRUE (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18 [L71] EXPR WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_1 [L71] EXPR (WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15 [L71] EXPR WrapperStruct00.var_1_15 [L71] EXPR (WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51] [L71] EXPR ((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17) [L71] EXPR WrapperStruct00.var_1_16 [L71] EXPR WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17 [L71] EXPR WrapperStruct00.var_1_17 [L71] EXPR WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51] [L71] EXPR ((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51] [L71] WrapperStruct00.var_1_11 = (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)) [L73] EXPR WrapperStruct00.var_1_1 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_1; [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_6 [L74] signed long int stepLocal_2 = WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6); [L75] WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=51, stepLocal_2=130050, stepLocal_3=51] [L75] COND FALSE !(WrapperStruct00.var_1_11) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_4 [L122] EXPR WrapperStruct00.var_1_5 [L122] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) [L122] EXPR WrapperStruct00.var_1_1 [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR (WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1) [L122] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1) [L122] EXPR WrapperStruct00.var_1_12 [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) [L122] EXPR WrapperStruct00.var_1_18 [L122] EXPR ((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) [L122] EXPR WrapperStruct00.var_1_18 [L122] EXPR WrapperStruct00.var_1_19 [L122] EXPR ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122-L123] return ((((WrapperStruct00.var_1_4 > (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) / WrapperStruct00.var_1_7) <= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3))) && (WrapperStruct00.var_1_11 ? ((WrapperStruct00.var_1_1 > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (((WrapperStruct00.var_1_1 % WrapperStruct00.var_1_7) < (WrapperStruct00.var_1_1 * (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_10)) : 1)) : 1)) && (((WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_18) < 0 ) ? -(WrapperStruct00.var_1_18) : (WrapperStruct00.var_1_18)))) >= WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((WrapperStruct00.var_1_6 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_15) || (WrapperStruct00.var_1_16 || WrapperStruct00.var_1_17)))) : 1)) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 186 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.2s, OverallIterations: 22, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1474 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1467 mSDsluCounter, 12317 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9139 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6443 IncrementalHoareTripleChecker+Invalid, 6575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 3178 mSDtfsCounter, 6443 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 923 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1176occurred in iteration=19, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1161 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 60.3s InterpolantComputationTime, 4179 NumberOfCodeBlocks, 4179 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3821 ConstructedInterpolants, 0 QuantifiedInterpolants, 13153 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1672 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 20054/20160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:58:59,561 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-44.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 f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:59:01,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:59:01,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:59:01,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:59:01,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:59:01,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:59:01,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:59:01,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:59:01,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:59:01,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:59:01,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:59:01,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:59:01,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:59:01,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:59:01,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:01,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:59:01,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:59:01,504 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 -> f5e750e5fa316e30fef8e3158d304f9d418ce308f7b74e89da459ba726747abe [2025-03-17 05:59:01,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:59:01,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:59:01,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:59:01,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:59:01,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:59:01,750 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-44.i [2025-03-17 05:59:02,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6221cbd0/7b8a3233dfc94c72a630fd736c9b4055/FLAG4e5d18673 [2025-03-17 05:59:03,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:59:03,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-44.i [2025-03-17 05:59:03,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6221cbd0/7b8a3233dfc94c72a630fd736c9b4055/FLAG4e5d18673 [2025-03-17 05:59:03,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6221cbd0/7b8a3233dfc94c72a630fd736c9b4055 [2025-03-17 05:59:03,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:59:03,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:59:03,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:03,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:59:03,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:59:03,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7a2cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03, skipping insertion in model container [2025-03-17 05:59:03,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:59:03,300 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-44.i[916,929] [2025-03-17 05:59:03,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:03,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:59:03,381 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-44.i[916,929] [2025-03-17 05:59:03,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:03,427 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:59:03,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03 WrapperNode [2025-03-17 05:59:03,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:03,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:03,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:59:03,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:59:03,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,469 INFO L138 Inliner]: procedures = 37, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-03-17 05:59:03,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:03,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:59:03,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:59:03,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:59:03,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,503 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-17 05:59:03,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:59:03,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:59:03,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:59:03,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:59:03,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:03" (1/1) ... [2025-03-17 05:59:03,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:03,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:59:03,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 05:59:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:59:03,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:59:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:59:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:59:03,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:59:03,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation