./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-73.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 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:54:46,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:54:46,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:54:46,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:54:46,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:54:46,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:54:46,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:54:46,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:54:46,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:54:46,547 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:54:46,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:54:46,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:54:46,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:54:46,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:54:46,548 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:54:46,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:54:46,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:54:46,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:54:46,550 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:54:46,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:54:46,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:54:46,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:54:46,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:54:46,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:46,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:54:46,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:54:46,551 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 -> 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 [2025-03-08 16:54:46,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:54:46,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:54:46,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:54:46,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:54:46,773 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:54:46,774 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-73.i [2025-03-08 16:54:47,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38562e569/1746a8c3392f449c971164cd1f70e305/FLAG09ab4298f [2025-03-08 16:54:48,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:54:48,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2025-03-08 16:54:48,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38562e569/1746a8c3392f449c971164cd1f70e305/FLAG09ab4298f [2025-03-08 16:54:48,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38562e569/1746a8c3392f449c971164cd1f70e305 [2025-03-08 16:54:48,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:54:48,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:54:48,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:54:48,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:54:48,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:54:48,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48, skipping insertion in model container [2025-03-08 16:54:48,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:54:48,265 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-73.i[916,929] [2025-03-08 16:54:48,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:54:48,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:54:48,319 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-73.i[916,929] [2025-03-08 16:54:48,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:54:48,378 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:54:48,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48 WrapperNode [2025-03-08 16:54:48,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:54:48,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:54:48,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:54:48,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:54:48,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,433 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2025-03-08 16:54:48,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:54:48,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:54:48,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:54:48,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:54:48,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,453 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:54:48,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:54:48,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:54:48,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:54:48,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:54:48,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (1/1) ... [2025-03-08 16:54:48,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:48,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:48,509 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-08 16:54:48,511 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-08 16:54:48,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:54:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:54:48,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:54:48,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:54:48,613 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:54:48,614 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:54:49,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-08 16:54:49,041 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-08 16:54:49,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:54:49,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:54:49,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:54:49,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:49 BoogieIcfgContainer [2025-03-08 16:54:49,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:54:49,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:54:49,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:54:49,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:54:49,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:54:48" (1/3) ... [2025-03-08 16:54:49,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:49, skipping insertion in model container [2025-03-08 16:54:49,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:48" (2/3) ... [2025-03-08 16:54:49,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:49, skipping insertion in model container [2025-03-08 16:54:49,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:49" (3/3) ... [2025-03-08 16:54:49,058 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2025-03-08 16:54:49,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:54:49,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-73.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:54:49,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:54:49,120 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;@514b7a4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:54:49,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:54:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:54:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:54:49,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:49,135 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:49,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1749239655, now seen corresponding path program 1 times [2025-03-08 16:54:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931468851] [2025-03-08 16:54:49,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:49,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:49,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:49,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:54:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931468851] [2025-03-08 16:54:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931468851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230363981] [2025-03-08 16:54:49,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:49,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:49,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:49,458 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-08 16:54:49,463 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-08 16:54:49,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:49,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:49,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:49,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:54:49,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:54:49,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230363981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:49,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:49,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:54:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622067416] [2025-03-08 16:54:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:49,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:54:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:49,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:54:49,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:54:49,718 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:54:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:49,737 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2025-03-08 16:54:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:54:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-08 16:54:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:49,742 INFO L225 Difference]: With dead ends: 212 [2025-03-08 16:54:49,743 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 16:54:49,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-08 16:54:49,746 INFO L435 NwaCegarLoop]: 155 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, 155 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-08 16:54:49,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:54:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 16:54:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 16:54:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:54:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-08 16:54:49,783 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2025-03-08 16:54:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:49,784 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-08 16:54:49,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:54:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-03-08 16:54:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:54:49,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:49,787 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:49,794 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-08 16:54:49,988 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-08 16:54:49,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:49,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -838580344, now seen corresponding path program 1 times [2025-03-08 16:54:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693387368] [2025-03-08 16:54:49,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:50,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:50,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:50,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:50,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:54:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693387368] [2025-03-08 16:54:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693387368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148007794] [2025-03-08 16:54:50,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:50,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:50,408 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-08 16:54:50,409 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-08 16:54:50,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:50,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:50,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:50,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:50,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:54:50,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:50,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148007794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:50,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:50,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 16:54:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859564572] [2025-03-08 16:54:50,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:50,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:50,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:50,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:50,608 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:50,643 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2025-03-08 16:54:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:54:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:50,647 INFO L225 Difference]: With dead ends: 212 [2025-03-08 16:54:50,648 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:54:50,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 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-08 16:54:50,649 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 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-08 16:54:50,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:54:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:54:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-08 16:54:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:54:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-08 16:54:50,658 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2025-03-08 16:54:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:50,659 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-08 16:54:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-08 16:54:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:54:50,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:50,661 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:50,667 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-08 16:54:50,861 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-08 16:54:50,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 48923337, now seen corresponding path program 1 times [2025-03-08 16:54:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800507776] [2025-03-08 16:54:50,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:50,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:50,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:54:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800507776] [2025-03-08 16:54:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800507776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989278129] [2025-03-08 16:54:51,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:51,079 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-08 16:54:51,081 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-08 16:54:51,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:51,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:51,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:51,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:51,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:54:51,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:51,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:51,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989278129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:51,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:51,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 16:54:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472244609] [2025-03-08 16:54:51,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:51,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:51,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:51,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:51,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:51,294 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:51,325 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-03-08 16:54:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:51,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:54:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:51,329 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:54:51,329 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 16:54:51,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 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-08 16:54:51,330 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 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-08 16:54:51,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:54:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 16:54:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-08 16:54:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:54:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-03-08 16:54:51,337 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2025-03-08 16:54:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:51,337 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-03-08 16:54:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-03-08 16:54:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:54:51,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:51,339 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:51,345 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-08 16:54:51,539 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-08 16:54:51,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:51,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash 49846858, now seen corresponding path program 1 times [2025-03-08 16:54:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:51,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273582090] [2025-03-08 16:54:51,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:51,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:51,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:51,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:51,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 16:54:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273582090] [2025-03-08 16:54:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273582090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147969649] [2025-03-08 16:54:51,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:51,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:51,703 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-08 16:54:51,705 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-08 16:54:51,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:54:51,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:54:51,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:51,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:51,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:54:51,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:51,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147969649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:51,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:51,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 16:54:51,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826159219] [2025-03-08 16:54:51,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:51,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:51,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:51,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:51,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:51,906 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:51,923 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2025-03-08 16:54:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:54:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:51,925 INFO L225 Difference]: With dead ends: 219 [2025-03-08 16:54:51,925 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 16:54:51,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 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-08 16:54:51,926 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-08 16:54:51,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:54:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 16:54:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 16:54:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:54:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-03-08 16:54:51,932 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 129 [2025-03-08 16:54:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:51,932 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-03-08 16:54:51,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-03-08 16:54:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:54:51,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:51,933 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:51,940 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-08 16:54:52,138 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-08 16:54:52,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash -294626520, now seen corresponding path program 1 times [2025-03-08 16:54:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669435586] [2025-03-08 16:54:52,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:52,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:54:52,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:54:52,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:52,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669435586] [2025-03-08 16:54:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669435586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:54:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323082802] [2025-03-08 16:54:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:54:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:53,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:54:53,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:54:53,487 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:53,962 INFO L93 Difference]: Finished difference Result 332 states and 480 transitions. [2025-03-08 16:54:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:53,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:54:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:53,964 INFO L225 Difference]: With dead ends: 332 [2025-03-08 16:54:53,964 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 16:54:53,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:53,964 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 99 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:53,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 334 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 16:54:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2025-03-08 16:54:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 314 transitions. [2025-03-08 16:54:53,982 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 314 transitions. Word has length 131 [2025-03-08 16:54:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:53,983 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 314 transitions. [2025-03-08 16:54:53,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 314 transitions. [2025-03-08 16:54:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:54:53,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:53,984 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:54:53,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -83275607, now seen corresponding path program 1 times [2025-03-08 16:54:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633031767] [2025-03-08 16:54:53,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:54,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:54:54,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:54:54,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:54,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:55,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633031767] [2025-03-08 16:54:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633031767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:54:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443810516] [2025-03-08 16:54:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:55,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:54:55,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:55,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:54:55,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:55,157 INFO L87 Difference]: Start difference. First operand 217 states and 314 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:55,802 INFO L93 Difference]: Finished difference Result 496 states and 718 transitions. [2025-03-08 16:54:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:54:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:54:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:55,804 INFO L225 Difference]: With dead ends: 496 [2025-03-08 16:54:55,804 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 16:54:55,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:54:55,805 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 227 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:55,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 473 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:54:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 16:54:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 215. [2025-03-08 16:54:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2025-03-08 16:54:55,824 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 131 [2025-03-08 16:54:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:55,824 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2025-03-08 16:54:55,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2025-03-08 16:54:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:54:55,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:55,825 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:55,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:54:55,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:55,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash -298114150, now seen corresponding path program 1 times [2025-03-08 16:54:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822215754] [2025-03-08 16:54:55,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:55,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:54:55,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:54:55,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:55,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:56,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:56,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822215754] [2025-03-08 16:54:56,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822215754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:56,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:56,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:54:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934210622] [2025-03-08 16:54:56,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:56,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:54:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:56,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:54:56,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:56,615 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:57,035 INFO L93 Difference]: Finished difference Result 493 states and 713 transitions. [2025-03-08 16:54:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:57,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-08 16:54:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:57,038 INFO L225 Difference]: With dead ends: 493 [2025-03-08 16:54:57,038 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 16:54:57,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:57,039 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 197 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:57,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 387 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 16:54:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 215. [2025-03-08 16:54:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 310 transitions. [2025-03-08 16:54:57,053 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 310 transitions. Word has length 132 [2025-03-08 16:54:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 310 transitions. [2025-03-08 16:54:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 310 transitions. [2025-03-08 16:54:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:54:57,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:57,054 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:54:57,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:57,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1958796857, now seen corresponding path program 1 times [2025-03-08 16:54:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543548294] [2025-03-08 16:54:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:57,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:54:57,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:54:57,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:57,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:54:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543548294] [2025-03-08 16:54:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543548294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:57,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:54:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315328634] [2025-03-08 16:54:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:54:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:57,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:54:57,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:57,953 INFO L87 Difference]: Start difference. First operand 215 states and 310 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:58,406 INFO L93 Difference]: Finished difference Result 493 states and 711 transitions. [2025-03-08 16:54:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:54:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-08 16:54:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:58,408 INFO L225 Difference]: With dead ends: 493 [2025-03-08 16:54:58,408 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 16:54:58,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:54:58,409 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 191 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:58,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 387 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:54:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 16:54:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 215. [2025-03-08 16:54:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:54:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 309 transitions. [2025-03-08 16:54:58,423 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 309 transitions. Word has length 132 [2025-03-08 16:54:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:58,423 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 309 transitions. [2025-03-08 16:54:58,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:54:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 309 transitions. [2025-03-08 16:54:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:54:58,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:58,425 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:54:58,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:54:58,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:58,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1448262680, now seen corresponding path program 1 times [2025-03-08 16:54:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:58,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965708372] [2025-03-08 16:54:58,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:58,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:54:58,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:54:58,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:58,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:54:58,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:54:58,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:54:58,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:54:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:54:58,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:54:58,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:54:58,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:54:58,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:54:58,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:58,600 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:54:58,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:54:58 BoogieIcfgContainer [2025-03-08 16:54:58,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:54:58,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:54:58,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:54:58,607 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:54:58,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:49" (3/4) ... [2025-03-08 16:54:58,609 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:54:58,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:54:58,611 INFO L158 Benchmark]: Toolchain (without parser) took 10467.21ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 132.8MB in the beginning and 202.7MB in the end (delta: -69.9MB). Peak memory consumption was 307.0MB. Max. memory is 16.1GB. [2025-03-08 16:54:58,611 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:58,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.71ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 116.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:54:58,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 112.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:58,612 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 109.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:54:58,612 INFO L158 Benchmark]: IcfgBuilder took 576.07ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 76.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:54:58,612 INFO L158 Benchmark]: TraceAbstraction took 9553.65ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 75.6MB in the beginning and 202.8MB in the end (delta: -127.2MB). Peak memory consumption was 248.3MB. Max. memory is 16.1GB. [2025-03-08 16:54:58,612 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 545.3MB. Free memory was 202.8MB in the beginning and 202.7MB in the end (delta: 133.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:58,613 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.71ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 116.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 112.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 109.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 576.07ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 76.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9553.65ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 75.6MB in the beginning and 202.8MB in the end (delta: -127.2MB). Peak memory consumption was 248.3MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 545.3MB. Free memory was 202.8MB in the beginning and 202.7MB in the end (delta: 133.9kB). 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] float last_1_WrapperStruct00_var_1_12 = 15.75; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_12=63/4] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_12 [L117] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] RET updateLastVariables() [L128] CALL updateVariables() [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_12=63/4] [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_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_7 [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_7 [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L104] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET updateVariables() [L129] CALL step() [L59] WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L59] COND FALSE !(WrapperStruct00.var_1_6) [L62] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L62] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) [L66] EXPR WrapperStruct00.var_1_8 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_8 [L67] EXPR WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L67] COND FALSE !(WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) [L78] EXPR WrapperStruct00.var_1_13 [L78] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L80] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_19 [L80] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L80] signed long int stepLocal_0 = (((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))); [L81] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L81] COND TRUE WrapperStruct00.var_1_8 <= stepLocal_0 [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L82] COND TRUE ! WrapperStruct00.var_1_6 [L83] EXPR WrapperStruct00.var_1_7 [L83] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L88] EXPR WrapperStruct00.var_1_18 [L88] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR (! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120-L121] return (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 175 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 716 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 716 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1992 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1945 IncrementalHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 1085 mSDtfsCounter, 1945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 207 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1690 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1546 ConstructedInterpolants, 0 QuantifiedInterpolants, 3327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1897 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 4886/5040 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-08 16:54:58,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.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 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:55:00,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:55:00,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:55:00,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:55:00,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:55:00,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:55:00,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:55:00,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:55:00,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:55:00,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:55:00,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:55:00,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:55:00,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:55:00,648 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:55:00,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:55:00,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:55:00,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:55:00,649 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 -> 9f2b0f6d9423f5a6deebebe280416f53043b6503d16a3708a82805a986909614 [2025-03-08 16:55:00,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:55:00,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:55:00,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:55:00,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:55:00,896 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:55:00,896 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-73.i [2025-03-08 16:55:02,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf0b2c2c/b8f8c9a5919d411f92508e5ac19ffb06/FLAGc1193a5cc [2025-03-08 16:55:02,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:55:02,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2025-03-08 16:55:02,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf0b2c2c/b8f8c9a5919d411f92508e5ac19ffb06/FLAGc1193a5cc [2025-03-08 16:55:02,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf0b2c2c/b8f8c9a5919d411f92508e5ac19ffb06 [2025-03-08 16:55:02,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:55:02,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:55:02,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:55:02,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:55:02,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:55:02,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2195f09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02, skipping insertion in model container [2025-03-08 16:55:02,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:55:02,734 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-73.i[916,929] [2025-03-08 16:55:02,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:55:02,783 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:55:02,790 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-73.i[916,929] [2025-03-08 16:55:02,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:55:02,842 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:55:02,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02 WrapperNode [2025-03-08 16:55:02,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:55:02,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:55:02,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:55:02,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:55:02,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,886 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-03-08 16:55:02,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:55:02,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:55:02,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:55:02,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:55:02,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,917 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-03-08 16:55:02,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:55:02,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:55:02,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:55:02,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:55:02,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (1/1) ... [2025-03-08 16:55:02,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:55:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:55:02,983 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-08 16:55:02,987 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-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:55:03,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 16:55:03,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 16:55:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:55:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:55:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 16:55:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 16:55:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:55:03,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:55:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 16:55:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 16:55:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:55:03,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:55:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:55:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:55:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:55:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:55:03,111 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:55:03,112 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:55:05,637 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-08 16:55:05,668 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-08 16:55:05,668 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:55:05,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:55:05,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:55:05,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:55:05 BoogieIcfgContainer [2025-03-08 16:55:05,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:55:05,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:55:05,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:55:05,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:55:05,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:55:02" (1/3) ... [2025-03-08 16:55:05,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5d4c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:55:05, skipping insertion in model container [2025-03-08 16:55:05,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:02" (2/3) ... [2025-03-08 16:55:05,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5d4c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:55:05, skipping insertion in model container [2025-03-08 16:55:05,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:55:05" (3/3) ... [2025-03-08 16:55:05,690 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2025-03-08 16:55:05,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:55:05,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-73.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:55:05,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:55:05,748 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;@49785d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:55:05,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:55:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:55:05,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:05,759 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:05,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:05,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1472770664, now seen corresponding path program 1 times [2025-03-08 16:55:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:05,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499468210] [2025-03-08 16:55:05,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:05,771 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-08 16:55:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:05,773 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-08 16:55:05,775 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-08 16:55:05,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:55:06,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:55:06,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:06,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:06,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:55:06,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-08 16:55:06,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:06,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:06,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499468210] [2025-03-08 16:55:06,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499468210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:06,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:55:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823524413] [2025-03-08 16:55:06,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:55:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:06,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:55:06,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:55:06,137 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:55:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:06,185 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2025-03-08 16:55:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:55:06,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-08 16:55:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:06,194 INFO L225 Difference]: With dead ends: 212 [2025-03-08 16:55:06,194 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 16:55:06,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-08 16:55:06,197 INFO L435 NwaCegarLoop]: 155 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, 155 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-08 16:55:06,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 16:55:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 16:55:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-08 16:55:06,232 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2025-03-08 16:55:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-08 16:55:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:55:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-03-08 16:55:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 16:55:06,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:06,235 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:06,244 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-08 16:55:06,436 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-08 16:55:06,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 234376633, now seen corresponding path program 1 times [2025-03-08 16:55:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607011091] [2025-03-08 16:55:06,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:06,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-08 16:55:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:06,439 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-08 16:55:06,440 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-08 16:55:06,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 16:55:06,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 16:55:06,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:06,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:06,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:55:06,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:06,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:06,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607011091] [2025-03-08 16:55:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607011091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:06,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:55:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084937873] [2025-03-08 16:55:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:06,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:55:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:55:06,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:55:06,756 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:06,799 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-03-08 16:55:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:55:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-08 16:55:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:06,801 INFO L225 Difference]: With dead ends: 211 [2025-03-08 16:55:06,801 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:55:06,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-08 16:55:06,802 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-08 16:55:06,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:55:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:55:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-08 16:55:06,809 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2025-03-08 16:55:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:06,810 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-08 16:55:06,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-08 16:55:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:55:06,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:06,811 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:06,820 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-08 16:55:07,011 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-08 16:55:07,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:07,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -863549737, now seen corresponding path program 1 times [2025-03-08 16:55:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919652873] [2025-03-08 16:55:07,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:07,013 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-08 16:55:07,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:07,015 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-08 16:55:07,016 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-08 16:55:07,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:55:07,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:55:07,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:07,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:07,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:55:07,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:07,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:07,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919652873] [2025-03-08 16:55:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919652873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:55:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627945076] [2025-03-08 16:55:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:55:07,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:07,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:55:07,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:55:07,338 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:07,397 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2025-03-08 16:55:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:55:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:55:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:07,399 INFO L225 Difference]: With dead ends: 218 [2025-03-08 16:55:07,399 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 16:55:07,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:55:07,400 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:07,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 16:55:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-08 16:55:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-03-08 16:55:07,405 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 131 [2025-03-08 16:55:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:07,406 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-03-08 16:55:07,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-03-08 16:55:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:55:07,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:07,407 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:07,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:55:07,607 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-08 16:55:07,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:07,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 23953944, now seen corresponding path program 1 times [2025-03-08 16:55:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738217329] [2025-03-08 16:55:07,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:07,609 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-08 16:55:07,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:07,611 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-08 16:55:07,611 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-08 16:55:07,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:55:07,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:55:07,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:07,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:55:07,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:07,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:07,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738217329] [2025-03-08 16:55:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738217329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:07,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:07,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:55:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341092378] [2025-03-08 16:55:07,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:07,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:55:07,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:07,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:55:07,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:55:07,938 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:07,999 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2025-03-08 16:55:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:55:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-08 16:55:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:08,000 INFO L225 Difference]: With dead ends: 224 [2025-03-08 16:55:08,000 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 16:55:08,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-08 16:55:08,001 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:08,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 16:55:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-08 16:55:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-03-08 16:55:08,015 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 131 [2025-03-08 16:55:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:08,015 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-03-08 16:55:08,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-03-08 16:55:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:55:08,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:08,016 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:08,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:55:08,219 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-08 16:55:08,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:08,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:08,220 INFO L85 PathProgramCache]: Analyzing trace with hash 24877465, now seen corresponding path program 1 times [2025-03-08 16:55:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216739531] [2025-03-08 16:55:08,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:08,221 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-08 16:55:08,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:08,223 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-08 16:55:08,225 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-08 16:55:08,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:55:08,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:55:08,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:08,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:08,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:55:08,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:08,653 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 95 treesize of output 41 [2025-03-08 16:55:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-08 16:55:08,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:08,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:08,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216739531] [2025-03-08 16:55:08,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216739531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:08,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:08,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:55:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753165514] [2025-03-08 16:55:08,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:08,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:55:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:08,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:55:08,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:55:08,685 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:55:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:11,331 INFO L93 Difference]: Finished difference Result 226 states and 324 transitions. [2025-03-08 16:55:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:55:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-08 16:55:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:11,334 INFO L225 Difference]: With dead ends: 226 [2025-03-08 16:55:11,334 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 16:55:11,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:55:11,335 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:11,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 438 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 16:55:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 16:55:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-08 16:55:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-03-08 16:55:11,341 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2025-03-08 16:55:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-03-08 16:55:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:55:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-03-08 16:55:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:55:11,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:11,343 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:11,353 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-08 16:55:11,543 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-08 16:55:11,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash 48878103, now seen corresponding path program 1 times [2025-03-08 16:55:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731230202] [2025-03-08 16:55:11,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:11,544 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-08 16:55:11,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:11,547 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-08 16:55:11,548 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-08 16:55:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:55:11,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:55:11,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:11,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:55:11,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:12,009 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 95 treesize of output 41 [2025-03-08 16:55:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 16:55:12,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:12,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:12,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731230202] [2025-03-08 16:55:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731230202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:55:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605596933] [2025-03-08 16:55:12,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:12,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:55:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:12,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:55:12,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:55:12,031 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:55:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:15,571 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2025-03-08 16:55:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:55:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-08 16:55:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:15,572 INFO L225 Difference]: With dead ends: 226 [2025-03-08 16:55:15,572 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 16:55:15,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:55:15,573 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 101 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:15,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 434 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 16:55:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 16:55:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-08 16:55:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2025-03-08 16:55:15,580 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2025-03-08 16:55:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:15,580 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2025-03-08 16:55:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:55:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2025-03-08 16:55:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:55:15,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:15,581 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:15,592 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-08 16:55:15,781 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-08 16:55:15,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:15,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash -365724007, now seen corresponding path program 1 times [2025-03-08 16:55:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023667663] [2025-03-08 16:55:15,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:15,782 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-08 16:55:15,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:15,784 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-08 16:55:15,785 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-08 16:55:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:55:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:55:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:16,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:55:16,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:16,101 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 22 treesize of output 10 [2025-03-08 16:55:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:16,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:16,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023667663] [2025-03-08 16:55:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023667663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:16,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:16,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:55:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034370100] [2025-03-08 16:55:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:55:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:16,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:55:16,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:55:16,140 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:17,550 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2025-03-08 16:55:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:55:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:55:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:17,551 INFO L225 Difference]: With dead ends: 227 [2025-03-08 16:55:17,551 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 16:55:17,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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-08 16:55:17,552 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:17,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:55:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 16:55:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 16:55:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2025-03-08 16:55:17,557 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 135 [2025-03-08 16:55:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2025-03-08 16:55:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2025-03-08 16:55:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:55:17,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:17,559 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:17,569 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-08 16:55:17,759 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-08 16:55:17,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:17,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -154373094, now seen corresponding path program 1 times [2025-03-08 16:55:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936173107] [2025-03-08 16:55:17,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:17,760 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-08 16:55:17,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:17,762 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-08 16:55:17,763 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-08 16:55:17,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:55:18,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:55:18,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:18,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:18,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:55:18,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:18,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:18,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 22 [2025-03-08 16:55:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:18,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:18,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936173107] [2025-03-08 16:55:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936173107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:18,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:55:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416791810] [2025-03-08 16:55:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:55:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:18,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:55:18,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:55:18,148 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:20,590 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2025-03-08 16:55:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:55:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-08 16:55:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:20,591 INFO L225 Difference]: With dead ends: 229 [2025-03-08 16:55:20,591 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 16:55:20,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:55:20,592 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:20,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 16:55:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 16:55:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2025-03-08 16:55:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-03-08 16:55:20,597 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 135 [2025-03-08 16:55:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:20,597 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-03-08 16:55:20,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-03-08 16:55:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:55:20,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:20,598 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:20,608 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-08 16:55:20,798 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-08 16:55:20,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:20,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1792831053, now seen corresponding path program 1 times [2025-03-08 16:55:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240573406] [2025-03-08 16:55:20,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:20,800 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-08 16:55:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:20,801 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-08 16:55:20,802 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-08 16:55:20,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:55:21,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:55:21,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:21,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:21,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 16:55:21,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:21,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 62 [2025-03-08 16:55:21,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:21,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2025-03-08 16:55:21,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:21,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 93 [2025-03-08 16:55:22,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:22,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 84 [2025-03-08 16:55:22,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:22,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2025-03-08 16:55:22,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:22,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2025-03-08 16:55:23,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:23,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2025-03-08 16:55:23,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:23,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 94 [2025-03-08 16:55:23,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:23,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 93 [2025-03-08 16:55:24,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:24,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 84 [2025-03-08 16:55:24,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:24,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 82 [2025-03-08 16:55:24,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:24,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 80 [2025-03-08 16:55:24,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:24,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 37 [2025-03-08 16:55:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 40 proven. 308 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 16:55:24,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:55:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:24,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:24,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240573406] [2025-03-08 16:55:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240573406] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:55:24,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:55:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-03-08 16:55:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126881426] [2025-03-08 16:55:24,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:55:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:24,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:55:24,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:55:24,808 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:25,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:55:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:27,360 INFO L93 Difference]: Finished difference Result 284 states and 401 transitions. [2025-03-08 16:55:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:55:27,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-03-08 16:55:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:27,362 INFO L225 Difference]: With dead ends: 284 [2025-03-08 16:55:27,362 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 16:55:27,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:55:27,362 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:27,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 371 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 16:55:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 16:55:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2025-03-08 16:55:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 97 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-03-08 16:55:27,370 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 136 [2025-03-08 16:55:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:27,370 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-03-08 16:55:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-03-08 16:55:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:55:27,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:27,371 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:27,383 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 (10)] Ended with exit code 0 [2025-03-08 16:55:27,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-08 16:55:27,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:27,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -245225236, now seen corresponding path program 1 times [2025-03-08 16:55:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:27,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88051894] [2025-03-08 16:55:27,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:27,573 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-08 16:55:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:27,574 INFO L229 MonitoredProcess]: Starting monitored process 11 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-08 16:55:27,575 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 (11)] Waiting until timeout for monitored process [2025-03-08 16:55:27,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:55:28,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:55:28,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:28,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:28,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 16:55:28,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:28,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:55:28,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 51 [2025-03-08 16:55:28,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:28,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-08 16:55:28,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:28,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 86 [2025-03-08 16:55:30,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:30,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 83 [2025-03-08 16:55:33,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:33,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 80 [2025-03-08 16:55:36,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:36,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2025-03-08 16:55:36,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:36,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2025-03-08 16:55:37,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:37,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 102 [2025-03-08 16:55:37,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:37,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 105 [2025-03-08 16:55:37,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:37,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 96 [2025-03-08 16:55:38,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:38,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 103 [2025-03-08 16:55:38,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 102 treesize of output 107 [2025-03-08 16:55:38,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:38,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 106 treesize of output 115 [2025-03-08 16:55:41,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:41,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 112 treesize of output 129 [2025-03-08 16:55:41,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:41,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 127 treesize of output 51 [2025-03-08 16:55:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 288 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:55:41,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:55:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:55:41,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88051894] [2025-03-08 16:55:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88051894] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:55:41,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:55:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2025-03-08 16:55:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150455522] [2025-03-08 16:55:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:55:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:41,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:55:41,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=164, Unknown=4, NotChecked=0, Total=210 [2025-03-08 16:55:41,338 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:43,428 INFO L93 Difference]: Finished difference Result 284 states and 399 transitions. [2025-03-08 16:55:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:55:43,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-03-08 16:55:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:43,429 INFO L225 Difference]: With dead ends: 284 [2025-03-08 16:55:43,429 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 16:55:43,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=46, Invalid=190, Unknown=4, NotChecked=0, Total=240 [2025-03-08 16:55:43,430 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 124 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:43,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 370 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 16:55:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 16:55:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2025-03-08 16:55:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:55:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-03-08 16:55:43,438 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 136 [2025-03-08 16:55:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-03-08 16:55:43,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:55:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-03-08 16:55:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:55:43,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:43,439 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:55:43,453 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 (11)] Ended with exit code 0 [2025-03-08 16:55:43,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-08 16:55:43,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash -755759413, now seen corresponding path program 1 times [2025-03-08 16:55:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921768182] [2025-03-08 16:55:43,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:43,641 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-08 16:55:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:43,642 INFO L229 MonitoredProcess]: Starting monitored process 12 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-08 16:55:43,643 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 (12)] Waiting until timeout for monitored process [2025-03-08 16:55:43,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:55:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:55:44,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:44,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 16:55:44,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:44,196 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-08 16:55:44,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:44,406 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 132 treesize of output 59 [2025-03-08 16:55:44,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:44,501 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 127 treesize of output 69 [2025-03-08 16:55:44,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:44,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:44,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:44,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:44,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:44,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:45,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:45,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:45,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:45,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-08 16:55:45,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 111 [2025-03-08 16:55:45,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 219 treesize of output 137 [2025-03-08 16:55:45,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:45,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 411 treesize of output 143 [2025-03-08 16:55:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 120 proven. 104 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-08 16:55:45,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:55:46,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921768182] [2025-03-08 16:55:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921768182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:55:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [498958454] [2025-03-08 16:55:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:46,199 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:55:46,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:55:46,201 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:55:46,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-08 16:55:46,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:55:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:55:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 16:55:47,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:47,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-08 16:55:48,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:48,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 71 [2025-03-08 16:55:48,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:48,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 82 [2025-03-08 16:55:49,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:49,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:49,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:49,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:49,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:49,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:49,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:49,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:50,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:50,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:50,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:50,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:50,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:50,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2025-03-08 16:55:50,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:50,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 128 [2025-03-08 16:55:50,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:50,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 181 treesize of output 150 [2025-03-08 16:55:50,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 337 treesize of output 161 [2025-03-08 16:55:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 128 proven. 104 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-08 16:55:50,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:55:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [498958454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:55:51,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:55:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2025-03-08 16:55:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292369583] [2025-03-08 16:55:51,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:55:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 16:55:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:51,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 16:55:51,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:55:51,115 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 21 states have internal predecessors, (130), 7 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2025-03-08 16:56:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:07,858 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2025-03-08 16:56:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:56:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 21 states have internal predecessors, (130), 7 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) Word has length 136 [2025-03-08 16:56:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:07,860 INFO L225 Difference]: With dead ends: 349 [2025-03-08 16:56:07,860 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 16:56:07,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 16:56:07,861 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 815 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:07,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 664 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2025-03-08 16:56:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 16:56:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2025-03-08 16:56:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 194 states have (on average 1.3041237113402062) internal successors, (253), 196 states have internal predecessors, (253), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:56:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2025-03-08 16:56:07,889 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 317 transitions. Word has length 136 [2025-03-08 16:56:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:07,890 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 317 transitions. [2025-03-08 16:56:07,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 21 states have internal predecessors, (130), 7 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2025-03-08 16:56:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 317 transitions. [2025-03-08 16:56:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:56:07,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:07,891 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:56:07,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2025-03-08 16:56:08,105 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 (12)] Ended with exit code 0 [2025-03-08 16:56:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /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-08 16:56:08,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1396845556, now seen corresponding path program 1 times [2025-03-08 16:56:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:56:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459094373] [2025-03-08 16:56:08,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:08,293 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-08 16:56:08,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:56:08,296 INFO L229 MonitoredProcess]: Starting monitored process 14 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-08 16:56:08,297 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 (14)] Waiting until timeout for monitored process [2025-03-08 16:56:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:56:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:56:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:08,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:56:08,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-08 16:56:08,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:56:08,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:56:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459094373] [2025-03-08 16:56:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459094373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:56:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:56:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:56:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900539954] [2025-03-08 16:56:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:56:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:56:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:56:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:56:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:56:08,591 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:56:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:08,649 INFO L93 Difference]: Finished difference Result 456 states and 624 transitions. [2025-03-08 16:56:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:56:08,650 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 16:56:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:08,652 INFO L225 Difference]: With dead ends: 456 [2025-03-08 16:56:08,652 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 16:56:08,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 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-08 16:56:08,653 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:08,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:56:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 16:56:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-08 16:56:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 196 states have internal predecessors, (252), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:56:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-03-08 16:56:08,665 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 136 [2025-03-08 16:56:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-03-08 16:56:08,666 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:56:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-03-08 16:56:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:56:08,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:08,667 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:56:08,676 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 (14)] Ended with exit code 0 [2025-03-08 16:56:08,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-08 16:56:08,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:08,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1898886647, now seen corresponding path program 1 times [2025-03-08 16:56:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:56:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685130636] [2025-03-08 16:56:08,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:08,868 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-08 16:56:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:56:08,870 INFO L229 MonitoredProcess]: Starting monitored process 15 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-08 16:56:08,872 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 (15)] Waiting until timeout for monitored process [2025-03-08 16:56:08,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:56:09,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:56:09,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:09,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:09,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 16:56:09,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:09,473 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-08 16:56:09,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:09,747 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 125 treesize of output 67 [2025-03-08 16:56:09,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:09,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-03-08 16:56:10,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:10,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-03-08 16:56:10,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:10,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-03-08 16:56:10,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:10,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 80 [2025-03-08 16:56:10,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:10,572 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 150 treesize of output 83 [2025-03-08 16:56:10,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:10,735 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 145 treesize of output 93 [2025-03-08 16:56:11,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:11,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 96 [2025-03-08 16:56:11,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:11,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 96 [2025-03-08 16:56:11,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:11,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 216 treesize of output 135 [2025-03-08 16:56:11,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:11,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 237 treesize of output 152 [2025-03-08 16:56:11,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 429 treesize of output 149 [2025-03-08 16:56:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 140 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 16:56:11,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:56:12,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:56:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685130636] [2025-03-08 16:56:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685130636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:56:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1725218677] [2025-03-08 16:56:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:12,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:56:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:56:12,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:56:12,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-08 16:56:12,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:56:13,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:56:13,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:13,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:13,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 16:56:13,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:56:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:56:14,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:56:14,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:56:14,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:56:14,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:56:14,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 61 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 26 [2025-03-08 16:56:14,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 36 [2025-03-08 16:56:14,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17