./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.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-63.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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:59:57,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:59:57,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:59:57,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:59:57,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:59:57,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:59:57,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:59:57,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:59:57,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:59:57,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:59:57,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:59:57,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:59:57,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:59:57,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:59:57,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:59:57,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:59:57,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:59:57,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:57,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:59:57,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:59:57,374 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2025-03-17 05:59:57,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:59:57,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:59:57,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:59:57,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:59:57,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:59:57,610 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-63.i [2025-03-17 05:59:58,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2194482bc/2bbced42395d4b8c8d8fc4230bedb337/FLAG9f75b6c86 [2025-03-17 05:59:59,093 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:59:59,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2025-03-17 05:59:59,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2194482bc/2bbced42395d4b8c8d8fc4230bedb337/FLAG9f75b6c86 [2025-03-17 05:59:59,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2194482bc/2bbced42395d4b8c8d8fc4230bedb337 [2025-03-17 05:59:59,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:59:59,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:59:59,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:59,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:59:59,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:59:59,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:59" (1/1) ... [2025-03-17 05:59:59,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:59, skipping insertion in model container [2025-03-17 05:59:59,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:59" (1/1) ... [2025-03-17 05:59:59,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:59:59,511 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-63.i[916,929] [2025-03-17 05:59:59,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:59,588 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:59:59,596 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-63.i[916,929] [2025-03-17 05:59:59,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:59,662 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:59:59,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:59 WrapperNode [2025-03-17 05:59:59,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:59,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:59,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:59:59,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:59:59,669 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:59" (1/1) ... [2025-03-17 05:59:59,681 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:59" (1/1) ... [2025-03-17 05:59:59,719 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 658 [2025-03-17 05:59:59,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:59,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:59:59,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:59:59,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:59:59,727 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:59" (1/1) ... [2025-03-17 05:59:59,727 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:59" (1/1) ... [2025-03-17 05:59:59,731 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:59" (1/1) ... [2025-03-17 05:59:59,735 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:59:59,735 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:59" (1/1) ... [2025-03-17 05:59:59,735 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:59" (1/1) ... [2025-03-17 05:59:59,750 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:59" (1/1) ... [2025-03-17 05:59:59,751 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:59" (1/1) ... [2025-03-17 05:59:59,752 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:59" (1/1) ... [2025-03-17 05:59:59,753 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:59" (1/1) ... [2025-03-17 05:59:59,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:59:59,757 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:59:59,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:59:59,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:59:59,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:59" (1/1) ... [2025-03-17 05:59:59,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:59,781 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:59,783 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:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:59:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:59:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:59:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:59:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:59:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:59:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:59:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:59:59,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:59:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:59:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:59:59,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:59:59,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:59:59,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:00:00,416 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-03-17 06:00:00,477 INFO L? ?]: Removed 199 outVars from TransFormulas that were not future-live. [2025-03-17 06:00:00,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:00:00,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:00:00,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:00:00,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:00 BoogieIcfgContainer [2025-03-17 06:00:00,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:00:00,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:00:00,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:00:00,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:00:00,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:59:59" (1/3) ... [2025-03-17 06:00:00,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bfb2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:00, skipping insertion in model container [2025-03-17 06:00:00,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:59" (2/3) ... [2025-03-17 06:00:00,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bfb2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:00, skipping insertion in model container [2025-03-17 06:00:00,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:00" (3/3) ... [2025-03-17 06:00:00,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2025-03-17 06:00:00,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:00:00,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-63.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:00:00,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:00:00,574 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;@6b3eb79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:00:00,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:00:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:00,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:00,590 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:00,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:00,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1772508185, now seen corresponding path program 1 times [2025-03-17 06:00:00,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:00,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267558834] [2025-03-17 06:00:00,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:00,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:00,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:00,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:00,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 06:00:01,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:01,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267558834] [2025-03-17 06:00:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267558834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538288189] [2025-03-17 06:00:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:01,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:01,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:00:01,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:01,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:01,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:01,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:01,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:00:01,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 06:00:01,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:01,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538288189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:01,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:01,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:00:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837643167] [2025-03-17 06:00:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:00:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:01,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:00:01,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:01,306 INFO L87 Difference]: Start difference. First operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:01,331 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2025-03-17 06:00:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:00:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 06:00:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:01,337 INFO L225 Difference]: With dead ends: 263 [2025-03-17 06:00:01,338 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 06:00:01,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:01,342 INFO L435 NwaCegarLoop]: 194 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, 194 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:01,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 06:00:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 06:00:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2025-03-17 06:00:01,384 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 152 [2025-03-17 06:00:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:01,385 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2025-03-17 06:00:01,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2025-03-17 06:00:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:01,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:01,389 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:01,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:00:01,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:01,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1917987343, now seen corresponding path program 1 times [2025-03-17 06:00:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210461492] [2025-03-17 06:00:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:01,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:01,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:01,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:01,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210461492] [2025-03-17 06:00:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210461492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457328680] [2025-03-17 06:00:02,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:02,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:02,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:02,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:00:02,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:02,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:02,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:02,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:02,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:02,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:02,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457328680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:02,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:00:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711018269] [2025-03-17 06:00:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:02,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:02,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:02,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:02,321 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:02,373 INFO L93 Difference]: Finished difference Result 264 states and 391 transitions. [2025-03-17 06:00:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:02,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:00:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:02,378 INFO L225 Difference]: With dead ends: 264 [2025-03-17 06:00:02,379 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 06:00:02,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:02,380 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:02,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 06:00:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-03-17 06:00:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.415929203539823) internal successors, (160), 113 states have internal predecessors, (160), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-17 06:00:02,395 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 152 [2025-03-17 06:00:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-17 06:00:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-17 06:00:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:02,400 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:02,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:00:02,601 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,SelfDestructingSolverStorable1 [2025-03-17 06:00:02,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:02,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1624584336, now seen corresponding path program 1 times [2025-03-17 06:00:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761207782] [2025-03-17 06:00:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:02,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:02,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:02,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761207782] [2025-03-17 06:00:02,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761207782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4758565] [2025-03-17 06:00:02,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:02,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:02,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:02,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:00:03,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:03,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:03,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:03,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:03,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4758565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:03,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:03,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:00:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564561576] [2025-03-17 06:00:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:03,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:03,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:03,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:03,103 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:03,130 INFO L93 Difference]: Finished difference Result 268 states and 395 transitions. [2025-03-17 06:00:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:03,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:00:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:03,132 INFO L225 Difference]: With dead ends: 268 [2025-03-17 06:00:03,132 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 06:00:03,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:03,133 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:03,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 06:00:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2025-03-17 06:00:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-17 06:00:03,142 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 152 [2025-03-17 06:00:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:03,143 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-17 06:00:03,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-17 06:00:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:03,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:03,145 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:03,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:00:03,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:03,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash -182870127, now seen corresponding path program 1 times [2025-03-17 06:00:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015587661] [2025-03-17 06:00:03,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:03,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:03,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:03,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:03,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015587661] [2025-03-17 06:00:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015587661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293535430] [2025-03-17 06:00:03,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:03,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:03,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:00:03,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:03,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:03,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:03,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:03,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:03,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:03,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293535430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:00:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482146832] [2025-03-17 06:00:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:03,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:03,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:03,922 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:03,949 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2025-03-17 06:00:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:00:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:03,952 INFO L225 Difference]: With dead ends: 272 [2025-03-17 06:00:03,953 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 06:00:03,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:03,955 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:03,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 563 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 06:00:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-17 06:00:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-03-17 06:00:03,968 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 152 [2025-03-17 06:00:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:03,968 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-03-17 06:00:03,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-03-17 06:00:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:03,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:03,969 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:03,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:04,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:04,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash 704633554, now seen corresponding path program 1 times [2025-03-17 06:00:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090329736] [2025-03-17 06:00:04,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:04,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:04,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:04,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090329736] [2025-03-17 06:00:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090329736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487344125] [2025-03-17 06:00:04,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:04,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:00:04,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:04,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:04,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:04,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:04,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:04,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487344125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:04,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:00:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059144338] [2025-03-17 06:00:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:04,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:04,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:04,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:04,685 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:04,711 INFO L93 Difference]: Finished difference Result 276 states and 403 transitions. [2025-03-17 06:00:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:00:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:04,715 INFO L225 Difference]: With dead ends: 276 [2025-03-17 06:00:04,715 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 06:00:04,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:04,716 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:04,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 06:00:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-17 06:00:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-17 06:00:04,724 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 152 [2025-03-17 06:00:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:04,724 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-17 06:00:04,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-17 06:00:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:04,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:04,729 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:04,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:04,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:04,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash 705557075, now seen corresponding path program 1 times [2025-03-17 06:00:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:04,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558539331] [2025-03-17 06:00:04,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:04,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558539331] [2025-03-17 06:00:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558539331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693811583] [2025-03-17 06:00:05,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:05,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:05,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:05,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 06:00:05,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:05,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:05,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:05,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:05,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:05,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:05,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693811583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:00:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256117501] [2025-03-17 06:00:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:05,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:05,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:05,451 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:05,481 INFO L93 Difference]: Finished difference Result 279 states and 406 transitions. [2025-03-17 06:00:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:05,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:00:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:05,483 INFO L225 Difference]: With dead ends: 279 [2025-03-17 06:00:05,484 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 06:00:05,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:05,485 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:05,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 06:00:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 06:00:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-17 06:00:05,497 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 152 [2025-03-17 06:00:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:05,500 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-17 06:00:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-17 06:00:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:05,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:05,502 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:05,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:05,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:05,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:05,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 146517713, now seen corresponding path program 1 times [2025-03-17 06:00:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:05,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829964932] [2025-03-17 06:00:05,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:05,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:05,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:05,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829964932] [2025-03-17 06:00:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829964932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35090525] [2025-03-17 06:00:06,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:06,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:06,922 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:06,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 06:00:07,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:07,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 06:00:07,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:07,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:00:07,406 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 25 treesize of output 13 [2025-03-17 06:00:07,461 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 25 treesize of output 13 [2025-03-17 06:00:07,520 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 25 treesize of output 13 [2025-03-17 06:00:07,604 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 25 treesize of output 13 [2025-03-17 06:00:07,692 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 25 treesize of output 13 [2025-03-17 06:00:07,756 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 25 treesize of output 13 [2025-03-17 06:00:07,818 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 25 treesize of output 13 [2025-03-17 06:00:07,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:07,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2025-03-17 06:00:08,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:08,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 64 [2025-03-17 06:00:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 06:00:08,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35090525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:08,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:00:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-03-17 06:00:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655637832] [2025-03-17 06:00:08,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:00:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:08,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:00:08,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:00:08,558 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 19 states, 16 states have (on average 8.125) internal successors, (130), 19 states have internal predecessors, (130), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2025-03-17 06:00:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:10,020 INFO L93 Difference]: Finished difference Result 395 states and 562 transitions. [2025-03-17 06:00:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 06:00:10,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.125) internal successors, (130), 19 states have internal predecessors, (130), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) Word has length 154 [2025-03-17 06:00:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:10,022 INFO L225 Difference]: With dead ends: 395 [2025-03-17 06:00:10,022 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 06:00:10,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 298 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 06:00:10,023 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 752 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:10,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 561 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 06:00:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 06:00:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 170. [2025-03-17 06:00:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 145 states have (on average 1.3793103448275863) internal successors, (200), 146 states have internal predecessors, (200), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 06:00:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 242 transitions. [2025-03-17 06:00:10,033 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 242 transitions. Word has length 154 [2025-03-17 06:00:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 242 transitions. [2025-03-17 06:00:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.125) internal successors, (130), 19 states have internal predecessors, (130), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2025-03-17 06:00:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 242 transitions. [2025-03-17 06:00:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:10,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:10,035 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:10,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:10,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:10,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -850554640, now seen corresponding path program 1 times [2025-03-17 06:00:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780773263] [2025-03-17 06:00:10,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:10,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:10,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780773263] [2025-03-17 06:00:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780773263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:00:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182027873] [2025-03-17 06:00:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:11,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:11,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:11,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:11,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:11,762 INFO L87 Difference]: Start difference. First operand 170 states and 242 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:12,148 INFO L93 Difference]: Finished difference Result 464 states and 656 transitions. [2025-03-17 06:00:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:00:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2025-03-17 06:00:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:12,151 INFO L225 Difference]: With dead ends: 464 [2025-03-17 06:00:12,151 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 06:00:12,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:00:12,152 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 126 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:12,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 691 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:00:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 06:00:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 310. [2025-03-17 06:00:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 264 states have (on average 1.375) internal successors, (363), 265 states have internal predecessors, (363), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:00:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 441 transitions. [2025-03-17 06:00:12,168 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 441 transitions. Word has length 154 [2025-03-17 06:00:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:12,168 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 441 transitions. [2025-03-17 06:00:12,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 441 transitions. [2025-03-17 06:00:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:00:12,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:12,170 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:12,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:00:12,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 464115826, now seen corresponding path program 1 times [2025-03-17 06:00:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148887976] [2025-03-17 06:00:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:12,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:00:12,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:00:12,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:12,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:13,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:13,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148887976] [2025-03-17 06:00:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148887976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:13,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:13,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:00:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687502448] [2025-03-17 06:00:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:13,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:13,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:13,351 INFO L87 Difference]: Start difference. First operand 310 states and 441 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:14,175 INFO L93 Difference]: Finished difference Result 597 states and 844 transitions. [2025-03-17 06:00:14,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:14,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-17 06:00:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:14,178 INFO L225 Difference]: With dead ends: 597 [2025-03-17 06:00:14,178 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 06:00:14,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:14,181 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 157 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:14,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 869 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:00:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 06:00:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 335. [2025-03-17 06:00:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 289 states have (on average 1.3840830449826989) internal successors, (400), 290 states have internal predecessors, (400), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 06:00:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 478 transitions. [2025-03-17 06:00:14,205 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 478 transitions. Word has length 156 [2025-03-17 06:00:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:14,208 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 478 transitions. [2025-03-17 06:00:14,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 478 transitions. [2025-03-17 06:00:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:00:14,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:14,209 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:00:14,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 814915763, now seen corresponding path program 1 times [2025-03-17 06:00:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220506654] [2025-03-17 06:00:14,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:00:14,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:00:14,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:14,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:14,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:14,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220506654] [2025-03-17 06:00:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220506654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:14,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:00:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948867892] [2025-03-17 06:00:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:14,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:00:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:00:14,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:14,711 INFO L87 Difference]: Start difference. First operand 335 states and 478 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:15,146 INFO L93 Difference]: Finished difference Result 655 states and 930 transitions. [2025-03-17 06:00:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:00:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 06:00:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:15,150 INFO L225 Difference]: With dead ends: 655 [2025-03-17 06:00:15,150 INFO L226 Difference]: Without dead ends: 482 [2025-03-17 06:00:15,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:00:15,152 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 166 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:15,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 542 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:00:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-17 06:00:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 475. [2025-03-17 06:00:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 408 states have (on average 1.3799019607843137) internal successors, (563), 409 states have internal predecessors, (563), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 06:00:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 677 transitions. [2025-03-17 06:00:15,187 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 677 transitions. Word has length 156 [2025-03-17 06:00:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:15,190 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 677 transitions. [2025-03-17 06:00:15,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 677 transitions. [2025-03-17 06:00:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:00:15,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:15,191 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:15,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:00:15,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:15,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2123913024, now seen corresponding path program 1 times [2025-03-17 06:00:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:15,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413289926] [2025-03-17 06:00:15,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:15,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:00:15,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:00:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:15,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:15,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413289926] [2025-03-17 06:00:15,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413289926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:15,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:15,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:00:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528837828] [2025-03-17 06:00:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:15,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:15,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:15,946 INFO L87 Difference]: Start difference. First operand 475 states and 677 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:16,468 INFO L93 Difference]: Finished difference Result 962 states and 1359 transitions. [2025-03-17 06:00:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:00:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-17 06:00:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:16,471 INFO L225 Difference]: With dead ends: 962 [2025-03-17 06:00:16,471 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 06:00:16,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:16,476 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 128 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:16,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 639 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:00:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 06:00:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 508. [2025-03-17 06:00:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 434 states have (on average 1.3640552995391706) internal successors, (592), 435 states have internal predecessors, (592), 60 states have call successors, (60), 13 states have call predecessors, (60), 13 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 06:00:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 712 transitions. [2025-03-17 06:00:16,516 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 712 transitions. Word has length 156 [2025-03-17 06:00:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:16,517 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 712 transitions. [2025-03-17 06:00:16,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 712 transitions. [2025-03-17 06:00:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:00:16,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:16,519 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:00:16,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1830510017, now seen corresponding path program 1 times [2025-03-17 06:00:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646936074] [2025-03-17 06:00:16,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:16,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:00:16,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:00:16,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:16,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646936074] [2025-03-17 06:00:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646936074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:16,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:16,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:00:16,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752607251] [2025-03-17 06:00:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:16,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:16,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:16,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:16,774 INFO L87 Difference]: Start difference. First operand 508 states and 712 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:17,204 INFO L93 Difference]: Finished difference Result 1367 states and 1897 transitions. [2025-03-17 06:00:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:00:17,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 06:00:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:17,210 INFO L225 Difference]: With dead ends: 1367 [2025-03-17 06:00:17,210 INFO L226 Difference]: Without dead ends: 896 [2025-03-17 06:00:17,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:00:17,214 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 136 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:17,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 954 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:00:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-17 06:00:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 667. [2025-03-17 06:00:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 571 states have (on average 1.3485113835376532) internal successors, (770), 573 states have internal predecessors, (770), 78 states have call successors, (78), 17 states have call predecessors, (78), 17 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 06:00:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 926 transitions. [2025-03-17 06:00:17,266 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 926 transitions. Word has length 156 [2025-03-17 06:00:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:17,267 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 926 transitions. [2025-03-17 06:00:17,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 926 transitions. [2025-03-17 06:00:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:00:17,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:17,268 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:17,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:00:17,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:17,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1312904220, now seen corresponding path program 1 times [2025-03-17 06:00:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:17,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228514072] [2025-03-17 06:00:17,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:17,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:17,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:17,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:17,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:17,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228514072] [2025-03-17 06:00:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228514072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:00:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793117052] [2025-03-17 06:00:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:18,375 INFO L87 Difference]: Start difference. First operand 667 states and 926 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:18,845 INFO L93 Difference]: Finished difference Result 685 states and 946 transitions. [2025-03-17 06:00:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:18,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2025-03-17 06:00:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:18,850 INFO L225 Difference]: With dead ends: 685 [2025-03-17 06:00:18,850 INFO L226 Difference]: Without dead ends: 683 [2025-03-17 06:00:18,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:00:18,852 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 103 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:18,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 551 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:00:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-17 06:00:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-17 06:00:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 586 states have (on average 1.3395904436860069) internal successors, (785), 588 states have internal predecessors, (785), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 06:00:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 941 transitions. [2025-03-17 06:00:18,896 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 941 transitions. Word has length 159 [2025-03-17 06:00:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:18,896 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 941 transitions. [2025-03-17 06:00:18,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 941 transitions. [2025-03-17 06:00:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:00:18,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:18,898 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:18,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:00:18,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1311980699, now seen corresponding path program 1 times [2025-03-17 06:00:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163158461] [2025-03-17 06:00:18,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:18,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:18,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:18,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:19,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163158461] [2025-03-17 06:00:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163158461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:19,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106776337] [2025-03-17 06:00:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:19,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:19,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:19,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:19,175 INFO L87 Difference]: Start difference. First operand 683 states and 941 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:19,380 INFO L93 Difference]: Finished difference Result 1341 states and 1837 transitions. [2025-03-17 06:00:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 06:00:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:19,384 INFO L225 Difference]: With dead ends: 1341 [2025-03-17 06:00:19,384 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 06:00:19,385 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 06:00:19,385 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 123 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:19,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 328 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:00:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 06:00:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 675. [2025-03-17 06:00:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 585 states have (on average 1.3333333333333333) internal successors, (780), 587 states have internal predecessors, (780), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:00:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 916 transitions. [2025-03-17 06:00:19,429 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 916 transitions. Word has length 159 [2025-03-17 06:00:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:19,429 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 916 transitions. [2025-03-17 06:00:19,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 916 transitions. [2025-03-17 06:00:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:00:19,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:19,433 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:19,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 06:00:19,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:19,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash -424477018, now seen corresponding path program 1 times [2025-03-17 06:00:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:19,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013954994] [2025-03-17 06:00:19,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:19,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:19,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013954994] [2025-03-17 06:00:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013954994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:19,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128686244] [2025-03-17 06:00:19,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:19,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:19,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:19,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:19,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:19,655 INFO L87 Difference]: Start difference. First operand 675 states and 916 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:19,873 INFO L93 Difference]: Finished difference Result 1309 states and 1775 transitions. [2025-03-17 06:00:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 06:00:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:19,879 INFO L225 Difference]: With dead ends: 1309 [2025-03-17 06:00:19,879 INFO L226 Difference]: Without dead ends: 675 [2025-03-17 06:00:19,881 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 06:00:19,881 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 150 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:19,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 274 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:00:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-17 06:00:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-03-17 06:00:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 585 states have (on average 1.3264957264957264) internal successors, (776), 587 states have internal predecessors, (776), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:00:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 912 transitions. [2025-03-17 06:00:19,923 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 912 transitions. Word has length 159 [2025-03-17 06:00:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:19,924 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 912 transitions. [2025-03-17 06:00:19,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 912 transitions. [2025-03-17 06:00:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 06:00:19,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:19,926 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 06:00:19,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2063035815, now seen corresponding path program 1 times [2025-03-17 06:00:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616357844] [2025-03-17 06:00:19,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:19,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:19,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:19,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:19,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:20,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616357844] [2025-03-17 06:00:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616357844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853564159] [2025-03-17 06:00:20,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:20,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:20,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:20,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 06:00:20,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 06:00:20,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 06:00:20,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:20,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:20,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:00:20,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:20,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853564159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:20,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:20,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 06:00:20,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284969785] [2025-03-17 06:00:20,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:20,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:20,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:20,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:20,378 INFO L87 Difference]: Start difference. First operand 675 states and 912 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:20,424 INFO L93 Difference]: Finished difference Result 1321 states and 1783 transitions. [2025-03-17 06:00:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 06:00:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:20,428 INFO L225 Difference]: With dead ends: 1321 [2025-03-17 06:00:20,428 INFO L226 Difference]: Without dead ends: 687 [2025-03-17 06:00:20,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 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 06:00:20,430 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:20,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-17 06:00:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-03-17 06:00:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 597 states have (on average 1.3199329983249581) internal successors, (788), 599 states have internal predecessors, (788), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 06:00:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 924 transitions. [2025-03-17 06:00:20,469 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 924 transitions. Word has length 159 [2025-03-17 06:00:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:20,470 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 924 transitions. [2025-03-17 06:00:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 924 transitions. [2025-03-17 06:00:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 06:00:20,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:20,472 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:20,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:20,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 06:00:20,676 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:20,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1060980755, now seen corresponding path program 1 times [2025-03-17 06:00:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242005373] [2025-03-17 06:00:20,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:20,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 06:00:20,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 06:00:20,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:20,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:00:20,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:00:20,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 06:00:20,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 06:00:20,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:20,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:00:20,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:00:20,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:00:20,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:00:20,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:00:20,834 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:20,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:00:20,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:00:20 BoogieIcfgContainer [2025-03-17 06:00:20,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:00:20,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:00:20,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:00:20,900 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:00:20,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:00" (3/4) ... [2025-03-17 06:00:20,902 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:00:20,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:00:20,903 INFO L158 Benchmark]: Toolchain (without parser) took 21506.42ms. Allocated memory was 167.8MB in the beginning and 880.8MB in the end (delta: 713.0MB). Free memory was 123.3MB in the beginning and 321.5MB in the end (delta: -198.2MB). Peak memory consumption was 514.0MB. Max. memory is 16.1GB. [2025-03-17 06:00:20,903 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:20,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.44ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 104.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:00:20,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.52ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 99.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:00:20,903 INFO L158 Benchmark]: Boogie Preprocessor took 35.69ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 95.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:20,903 INFO L158 Benchmark]: IcfgBuilder took 733.81ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 57.7MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 06:00:20,903 INFO L158 Benchmark]: TraceAbstraction took 20407.27ms. Allocated memory was 167.8MB in the beginning and 880.8MB in the end (delta: 713.0MB). Free memory was 56.7MB in the beginning and 321.6MB in the end (delta: -264.9MB). Peak memory consumption was 446.9MB. Max. memory is 16.1GB. [2025-03-17 06:00:20,904 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 880.8MB. Free memory was 321.6MB in the beginning and 321.5MB in the end (delta: 186.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:20,904 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 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.44ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 104.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.52ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 99.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.69ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 95.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 733.81ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 57.7MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20407.27ms. Allocated memory was 167.8MB in the beginning and 880.8MB in the end (delta: 713.0MB). Free memory was 56.7MB in the beginning and 321.6MB in the end (delta: -264.9MB). Peak memory consumption was 446.9MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 880.8MB. Free memory was 321.6MB in the beginning and 321.5MB in the end (delta: 186.3kB). 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 78, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] signed short int last_1_WrapperStruct00_var_1_21 = 256; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_21 [L116] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L85] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L102] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET updateVariables() [L128] CALL step() [L67] EXPR WrapperStruct00.var_1_14 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L68] WrapperStruct00.var_1_21 = last_1_WrapperStruct00_var_1_21 [L69] EXPR WrapperStruct00.var_1_16 [L69] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_23 = WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR WrapperStruct00.var_1_3 [L71] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] COND FALSE !(((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) [L74] EXPR WrapperStruct00.var_1_22 [L74] signed char stepLocal_0 = WrapperStruct00.var_1_22; [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=62] [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=62] [L75] COND FALSE !(stepLocal_0 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] COND TRUE WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_22 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L79] WrapperStruct00.var_1_7 = (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119-L120] return (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 216 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1854 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1845 mSDsluCounter, 9164 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6554 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5001 IncrementalHoareTripleChecker+Invalid, 5189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 2610 mSDtfsCounter, 5001 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1576 GetRequests, 1442 SyntacticMatches, 10 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 469 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 3868 NumberOfCodeBlocks, 3868 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3834 ConstructedInterpolants, 0 QuantifiedInterpolants, 10130 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4667 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 14897/15300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:00:20,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:00:23,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:00:23,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:00:23,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:00:23,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:00:23,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:00:23,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:00:23,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:00:23,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:00:23,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:00:23,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:00:23,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:00:23,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:00:23,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:00:23,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:00:23,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:00:23,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:00:23,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:00:23,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:00:23,167 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:00:23,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:23,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:00:23,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:00:23,168 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2025-03-17 06:00:23,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:00:23,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:00:23,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:00:23,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:00:23,472 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:00:23,473 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-63.i [2025-03-17 06:00:24,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23bbb53c/8faf71cfcf5d4d52a4b04dffcc53837e/FLAGc112d0694 [2025-03-17 06:00:25,096 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:00:25,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2025-03-17 06:00:25,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23bbb53c/8faf71cfcf5d4d52a4b04dffcc53837e/FLAGc112d0694 [2025-03-17 06:00:25,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23bbb53c/8faf71cfcf5d4d52a4b04dffcc53837e [2025-03-17 06:00:25,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:00:25,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:00:25,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:25,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:00:25,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:00:25,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fa50ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25, skipping insertion in model container [2025-03-17 06:00:25,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:00:25,264 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-63.i[916,929] [2025-03-17 06:00:25,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:25,358 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:00:25,367 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-63.i[916,929] [2025-03-17 06:00:25,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:00:25,460 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:00:25,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25 WrapperNode [2025-03-17 06:00:25,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:00:25,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:25,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:00:25,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:00:25,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,534 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 652 [2025-03-17 06:00:25,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:00:25,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:00:25,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:00:25,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:00:25,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,593 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-03-17 06:00:25,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:00:25,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:00:25,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:00:25,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:00:25,630 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (1/1) ... [2025-03-17 06:00:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:00:25,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:25,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:00:25,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:00:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:00:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:00:25,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:00:25,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:00:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:00:25,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:00:25,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:00:28,239 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-03-17 06:00:28,277 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-03-17 06:00:28,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:00:28,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:00:28,289 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:00:28,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:28 BoogieIcfgContainer [2025-03-17 06:00:28,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:00:28,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:00:28,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:00:28,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:00:28,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:00:25" (1/3) ... [2025-03-17 06:00:28,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f5910b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:28, skipping insertion in model container [2025-03-17 06:00:28,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:00:25" (2/3) ... [2025-03-17 06:00:28,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f5910b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:00:28, skipping insertion in model container [2025-03-17 06:00:28,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:00:28" (3/3) ... [2025-03-17 06:00:28,298 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2025-03-17 06:00:28,309 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:00:28,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-63.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:00:28,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:00:28,356 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;@16d3eaf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:00:28,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:00:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:28,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:28,375 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:28,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2121181810, now seen corresponding path program 1 times [2025-03-17 06:00:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729466539] [2025-03-17 06:00:28,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:28,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:28,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:00:28,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:28,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:28,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:28,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:28,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:00:28,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-17 06:00:28,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:28,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729466539] [2025-03-17 06:00:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729466539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:28,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:28,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:00:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646457205] [2025-03-17 06:00:28,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:00:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:28,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:00:28,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:28,958 INFO L87 Difference]: Start difference. First operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:28,995 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2025-03-17 06:00:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:00:28,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 06:00:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:29,005 INFO L225 Difference]: With dead ends: 263 [2025-03-17 06:00:29,008 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 06:00:29,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:00:29,013 INFO L435 NwaCegarLoop]: 194 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, 194 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:29,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 06:00:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 06:00:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2025-03-17 06:00:29,083 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 152 [2025-03-17 06:00:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:29,083 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2025-03-17 06:00:29,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2025-03-17 06:00:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:29,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:29,090 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:29,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:00:29,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:29,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:29,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1975702652, now seen corresponding path program 1 times [2025-03-17 06:00:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162213744] [2025-03-17 06:00:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:29,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:29,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:29,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:29,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:00:29,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:29,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:29,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:29,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:29,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:29,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 06:00:29,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:29,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162213744] [2025-03-17 06:00:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162213744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:00:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336561240] [2025-03-17 06:00:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:29,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:29,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:29,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:29,760 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:29,819 INFO L93 Difference]: Finished difference Result 263 states and 390 transitions. [2025-03-17 06:00:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:29,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 06:00:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:29,825 INFO L225 Difference]: With dead ends: 263 [2025-03-17 06:00:29,826 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 06:00:29,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:29,827 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:29,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 06:00:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 06:00:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.415929203539823) internal successors, (160), 113 states have internal predecessors, (160), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-17 06:00:29,845 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 152 [2025-03-17 06:00:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:29,846 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-17 06:00:29,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:00:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-17 06:00:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 06:00:29,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:29,848 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:29,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:00:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:30,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1152021181, now seen corresponding path program 1 times [2025-03-17 06:00:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412189572] [2025-03-17 06:00:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:30,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:30,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:30,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:30,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:00:30,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 06:00:30,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 06:00:30,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:30,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:30,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:30,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:30,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:30,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:30,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412189572] [2025-03-17 06:00:30,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412189572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:30,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:30,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:00:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941938605] [2025-03-17 06:00:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:30,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:30,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:30,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:30,604 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:30,650 INFO L93 Difference]: Finished difference Result 267 states and 394 transitions. [2025-03-17 06:00:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:30,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 06:00:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:30,653 INFO L225 Difference]: With dead ends: 267 [2025-03-17 06:00:30,653 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 06:00:30,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:30,654 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:30,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 06:00:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-17 06:00:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-17 06:00:30,665 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 152 [2025-03-17 06:00:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:30,665 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-17 06:00:30,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-17 06:00:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:30,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:30,667 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:30,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:00:30,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:30,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:30,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1723288897, now seen corresponding path program 1 times [2025-03-17 06:00:30,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:30,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056081012] [2025-03-17 06:00:30,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:30,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:30,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:00:30,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:31,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:31,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:31,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:00:31,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:31,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:31,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056081012] [2025-03-17 06:00:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056081012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:31,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:00:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076710747] [2025-03-17 06:00:31,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:31,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:31,338 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:31,373 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2025-03-17 06:00:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:31,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2025-03-17 06:00:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:31,375 INFO L225 Difference]: With dead ends: 272 [2025-03-17 06:00:31,375 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 06:00:31,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:31,376 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:31,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 06:00:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-17 06:00:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-03-17 06:00:31,391 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 154 [2025-03-17 06:00:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:31,391 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-03-17 06:00:31,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-03-17 06:00:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:31,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:31,393 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:31,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:00:31,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:31,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1429885890, now seen corresponding path program 1 times [2025-03-17 06:00:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914692096] [2025-03-17 06:00:31,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:31,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:31,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:31,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:00:31,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:32,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:32,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:32,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:32,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:00:32,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:32,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:32,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:32,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914692096] [2025-03-17 06:00:32,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914692096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:32,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:32,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:00:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944505669] [2025-03-17 06:00:32,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:32,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:32,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:32,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:32,145 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:32,215 INFO L93 Difference]: Finished difference Result 278 states and 406 transitions. [2025-03-17 06:00:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:00:32,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2025-03-17 06:00:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:32,218 INFO L225 Difference]: With dead ends: 278 [2025-03-17 06:00:32,218 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 06:00:32,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:32,219 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:32,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 915 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 06:00:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-17 06:00:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-17 06:00:32,231 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 154 [2025-03-17 06:00:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-17 06:00:32,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-17 06:00:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:32,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:32,233 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:32,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:00:32,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:32,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:32,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash -377568573, now seen corresponding path program 1 times [2025-03-17 06:00:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:32,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708576848] [2025-03-17 06:00:32,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:32,440 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:32,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:00:32,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:32,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:32,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:32,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:00:32,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:32,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:32,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708576848] [2025-03-17 06:00:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708576848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:00:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065913533] [2025-03-17 06:00:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:32,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:32,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:32,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:32,974 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:33,031 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2025-03-17 06:00:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:33,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2025-03-17 06:00:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:33,036 INFO L225 Difference]: With dead ends: 284 [2025-03-17 06:00:33,036 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 06:00:33,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:33,036 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:33,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1086 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 06:00:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-03-17 06:00:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-03-17 06:00:33,048 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 154 [2025-03-17 06:00:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:33,049 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-03-17 06:00:33,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-03-17 06:00:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:33,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:33,050 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:33,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:00:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:33,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 509935108, now seen corresponding path program 1 times [2025-03-17 06:00:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546294741] [2025-03-17 06:00:33,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:33,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:00:33,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:33,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:33,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:33,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:33,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 06:00:33,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:00:33,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:33,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546294741] [2025-03-17 06:00:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546294741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:33,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:33,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:00:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558142935] [2025-03-17 06:00:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:33,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:00:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:33,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:00:33,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:33,704 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:33,775 INFO L93 Difference]: Finished difference Result 288 states and 415 transitions. [2025-03-17 06:00:33,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:00:33,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2025-03-17 06:00:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:33,778 INFO L225 Difference]: With dead ends: 288 [2025-03-17 06:00:33,779 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 06:00:33,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:33,779 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:33,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1259 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 06:00:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-03-17 06:00:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-03-17 06:00:33,784 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 154 [2025-03-17 06:00:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:33,784 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-03-17 06:00:33,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:00:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-03-17 06:00:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:33,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:33,785 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:33,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:00:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:33,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 510858629, now seen corresponding path program 1 times [2025-03-17 06:00:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752818338] [2025-03-17 06:00:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:33,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:33,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:33,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:00:34,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:34,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:34,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:34,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:34,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 06:00:34,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:34,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:00:34,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:00:34,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:00:34,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-03-17 06:00:34,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:34,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 06:00:35,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 06:00:35,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 06:00:35,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 06:00:35,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 39 [2025-03-17 06:00:35,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2025-03-17 06:00:35,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:00:35,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 35 [2025-03-17 06:00:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 353 proven. 39 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:00:35,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:00:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:00:36,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:00:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752818338] [2025-03-17 06:00:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752818338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:00:36,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:00:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2025-03-17 06:00:36,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743477853] [2025-03-17 06:00:36,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:00:36,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:00:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:00:36,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:00:36,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:00:36,097 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 14 states, 12 states have (on average 8.75) internal successors, (105), 14 states have internal predecessors, (105), 5 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 5 states have call successors, (32) [2025-03-17 06:00:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:41,359 INFO L93 Difference]: Finished difference Result 387 states and 541 transitions. [2025-03-17 06:00:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 06:00:41,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.75) internal successors, (105), 14 states have internal predecessors, (105), 5 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 5 states have call successors, (32) Word has length 154 [2025-03-17 06:00:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:41,361 INFO L225 Difference]: With dead ends: 387 [2025-03-17 06:00:41,361 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 06:00:41,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2025-03-17 06:00:41,362 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 703 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:41,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 460 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-17 06:00:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 06:00:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 157. [2025-03-17 06:00:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:00:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2025-03-17 06:00:41,373 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 154 [2025-03-17 06:00:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:41,374 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2025-03-17 06:00:41,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.75) internal successors, (105), 14 states have internal predecessors, (105), 5 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 5 states have call successors, (32) [2025-03-17 06:00:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2025-03-17 06:00:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 06:00:41,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:41,376 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:41,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 06:00:41,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:41,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:41,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -486213724, now seen corresponding path program 1 times [2025-03-17 06:00:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:00:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276239179] [2025-03-17 06:00:41,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:41,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:00:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:00:41,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:00:41,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 06:00:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 06:00:42,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 06:00:42,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:42,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:42,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 06:00:42,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:42,231 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 100 treesize of output 99 [2025-03-17 06:00:42,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 162 [2025-03-17 06:00:42,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 162 [2025-03-17 06:00:43,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 162 [2025-03-17 06:00:43,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 162 [2025-03-17 06:00:45,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 174 [2025-03-17 06:00:46,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 174 [2025-03-17 06:00:47,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 174 [2025-03-17 06:00:49,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 169 [2025-03-17 06:00:49,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 174 [2025-03-17 06:00:50,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 169 [2025-03-17 06:00:51,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 166 [2025-03-17 06:00:52,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 201 [2025-03-17 06:00:58,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 176 [2025-03-17 06:01:12,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 195 [2025-03-17 06:01:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 108 proven. 419 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-17 06:01:13,684 INFO L312 TraceCheckSpWp]: Computing backward predicates...