./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-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-?-8fc3dc6-m [2025-03-17 06:01:02,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:01:02,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:01:02,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:01:02,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:01:02,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:01:02,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:01:02,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:01:02,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:01:02,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:01:02,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:01:02,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:01:02,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:01:02,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:01:02,333 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:01:02,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:01:02,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:01:02,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:01:02,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:01:02,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:01:02,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:01:02,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:01:02,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:01:02,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:01:02,338 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-17 06:01:02,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:01:02,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:01:02,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:01:02,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:01:02,550 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:01:02,551 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-17 06:01:03,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5f036b5/7914b1066f0f4a9db66845d9fbb756ca/FLAGa5b1a725a [2025-03-17 06:01:03,919 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:01:03,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2025-03-17 06:01:03,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5f036b5/7914b1066f0f4a9db66845d9fbb756ca/FLAGa5b1a725a [2025-03-17 06:01:04,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5f036b5/7914b1066f0f4a9db66845d9fbb756ca [2025-03-17 06:01:04,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:01:04,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:01:04,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:01:04,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:01:04,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:01:04,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04, skipping insertion in model container [2025-03-17 06:01:04,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:01:04,373 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-17 06:01:04,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:01:04,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:01:04,448 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-17 06:01:04,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:01:04,507 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:01:04,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04 WrapperNode [2025-03-17 06:01:04,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:01:04,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:01:04,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:01:04,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:01:04,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,558 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2025-03-17 06:01:04,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:01:04,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:01:04,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:01:04,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:01:04,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,582 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:01:04,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:01:04,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:01:04,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:01:04,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:01:04,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (1/1) ... [2025-03-17 06:01:04,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:01:04,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:01:04,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:01:04,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:01:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:01:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:01:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:01:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:01:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:01:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:01:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:01:04,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:01:04,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:01:04,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:01:04,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:01:04,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:01:04,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:01:04,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:01:05,149 INFO L1322 $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-17 06:01:05,192 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 06:01:05,194 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:01:05,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:01:05,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:01:05,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:01:05 BoogieIcfgContainer [2025-03-17 06:01:05,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:01:05,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:01:05,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:01:05,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:01:05,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:01:04" (1/3) ... [2025-03-17 06:01:05,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28402aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:01:05, skipping insertion in model container [2025-03-17 06:01:05,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:04" (2/3) ... [2025-03-17 06:01:05,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28402aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:01:05, skipping insertion in model container [2025-03-17 06:01:05,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:01:05" (3/3) ... [2025-03-17 06:01:05,216 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2025-03-17 06:01:05,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:01:05,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-73.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:01:05,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:01:05,286 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;@27bd72e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:01:05,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:01:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 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-17 06:01:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:01:05,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:05,301 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] [2025-03-17 06:01:05,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:05,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1294897368, now seen corresponding path program 1 times [2025-03-17 06:01:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813617291] [2025-03-17 06:01:05,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:05,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:05,626 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-17 06:01:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813617291] [2025-03-17 06:01:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813617291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:01:05,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182580395] [2025-03-17 06:01:05,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:05,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:01:05,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:01:05,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:01:05,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:01:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:05,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:05,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:05,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:05,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:01:05,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:05,838 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-17 06:01:05,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182580395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:01:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:01:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367552720] [2025-03-17 06:01:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:05,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:01:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:05,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:01:05,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:01:05,867 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-17 06:01:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:05,886 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-03-17 06:01:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:01:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 124 [2025-03-17 06:01:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:05,892 INFO L225 Difference]: With dead ends: 203 [2025-03-17 06:01:05,892 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 06:01:05,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:01:05,900 INFO L435 NwaCegarLoop]: 150 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, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:05,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 06:01:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 06:01:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 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-17 06:01:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 06:01:05,929 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 124 [2025-03-17 06:01:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:05,929 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 06:01:05,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-17 06:01:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-17 06:01:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:01:05,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:05,932 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] [2025-03-17 06:01:05,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:01:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:01:06,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash -345635959, now seen corresponding path program 1 times [2025-03-17 06:01:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054840998] [2025-03-17 06:01:06,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:06,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:06,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:06,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:06,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:06,539 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-17 06:01:06,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054840998] [2025-03-17 06:01:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054840998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:01:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133254552] [2025-03-17 06:01:06,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:01:06,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:01:06,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:01:06,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:01:06,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:06,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:06,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:06,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:06,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:01:06,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:06,775 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-17 06:01:06,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133254552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:06,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:01:06,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:01:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878887761] [2025-03-17 06:01:06,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:06,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:06,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:06,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:01:06,779 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:06,815 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2025-03-17 06:01:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-17 06:01:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:06,817 INFO L225 Difference]: With dead ends: 204 [2025-03-17 06:01:06,817 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 06:01:06,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:01:06,820 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:06,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 06:01:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 06:01:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 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-17 06:01:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 06:01:06,829 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 124 [2025-03-17 06:01:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:06,830 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 06:01:06,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 06:01:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:01:06,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:06,831 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] [2025-03-17 06:01:06,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:01:07,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 06:01:07,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:07,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 541867722, now seen corresponding path program 1 times [2025-03-17 06:01:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374899405] [2025-03-17 06:01:07,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:07,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:07,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:07,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:07,260 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-17 06:01:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374899405] [2025-03-17 06:01:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374899405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:01:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672530448] [2025-03-17 06:01:07,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:07,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:01:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:01:07,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:01:07,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:01:07,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:07,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:07,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:07,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:01:07,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:07,464 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-17 06:01:07,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672530448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:01:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:01:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259843695] [2025-03-17 06:01:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:07,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:07,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:07,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:01:07,469 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:07,507 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2025-03-17 06:01:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-17 06:01:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:07,509 INFO L225 Difference]: With dead ends: 208 [2025-03-17 06:01:07,509 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 06:01:07,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:01:07,510 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:07,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 06:01:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 06:01:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 88 states have internal predecessors, (124), 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-17 06:01:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-03-17 06:01:07,527 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 124 [2025-03-17 06:01:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:07,527 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-03-17 06:01:07,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2025-03-17 06:01:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:01:07,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:07,529 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] [2025-03-17 06:01:07,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:01:07,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:01:07,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 542791243, now seen corresponding path program 1 times [2025-03-17 06:01:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498880872] [2025-03-17 06:01:07,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:07,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:07,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:07,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:07,920 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-17 06:01:07,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:07,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498880872] [2025-03-17 06:01:07,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498880872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:01:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375447852] [2025-03-17 06:01:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:07,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:01:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:01:07,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:01:07,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:01:08,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:08,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:08,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:08,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:01:08,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:08,117 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-17 06:01:08,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375447852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:08,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:01:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:01:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048170922] [2025-03-17 06:01:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:08,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:08,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:01:08,119 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:08,141 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-03-17 06:01:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-17 06:01:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:08,142 INFO L225 Difference]: With dead ends: 211 [2025-03-17 06:01:08,142 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 06:01:08,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:01:08,143 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:08,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 06:01:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 06:01:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 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-17 06:01:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 06:01:08,149 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 124 [2025-03-17 06:01:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 06:01:08,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 06:01:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:01:08,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:08,151 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] [2025-03-17 06:01:08,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:01:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:01:08,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 978524809, now seen corresponding path program 1 times [2025-03-17 06:01:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534437312] [2025-03-17 06:01:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:08,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:01:08,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:01:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:08,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:09,714 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-17 06:01:09,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:09,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534437312] [2025-03-17 06:01:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534437312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:09,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:09,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:01:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408965755] [2025-03-17 06:01:09,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:09,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:01:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:09,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:01:09,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:01:09,717 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (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-17 06:01:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:10,150 INFO L93 Difference]: Finished difference Result 321 states and 469 transitions. [2025-03-17 06:01:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:01:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (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 126 [2025-03-17 06:01:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:10,152 INFO L225 Difference]: With dead ends: 321 [2025-03-17 06:01:10,152 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 06:01:10,153 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-17 06:01:10,153 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 98 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:10,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 321 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:01:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 06:01:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2025-03-17 06:01:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 176 states have internal predecessors, (246), 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-17 06:01:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 306 transitions. [2025-03-17 06:01:10,174 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 306 transitions. Word has length 126 [2025-03-17 06:01:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:10,175 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 306 transitions. [2025-03-17 06:01:10,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (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-17 06:01:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 306 transitions. [2025-03-17 06:01:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:01:10,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:10,177 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] [2025-03-17 06:01:10,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:01:10,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:10,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 569700584, now seen corresponding path program 1 times [2025-03-17 06:01:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633903851] [2025-03-17 06:01:10,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:10,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:01:10,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:01:10,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:10,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:11,330 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-17 06:01:11,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633903851] [2025-03-17 06:01:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633903851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:11,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:01:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439271194] [2025-03-17 06:01:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:01:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:11,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:01:11,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:01:11,332 INFO L87 Difference]: Start difference. First operand 209 states and 306 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-17 06:01:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:12,055 INFO L93 Difference]: Finished difference Result 478 states and 700 transitions. [2025-03-17 06:01:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:01:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 126 [2025-03-17 06:01:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:12,057 INFO L225 Difference]: With dead ends: 478 [2025-03-17 06:01:12,057 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 06:01:12,058 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-17 06:01:12,058 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 166 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:12,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 652 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:01:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 06:01:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 207. [2025-03-17 06:01:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3908045977011494) internal successors, (242), 174 states have internal predecessors, (242), 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-17 06:01:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2025-03-17 06:01:12,069 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 126 [2025-03-17 06:01:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:12,069 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2025-03-17 06:01:12,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-17 06:01:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2025-03-17 06:01:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:01:12,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:12,071 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] [2025-03-17 06:01:12,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:01:12,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:12,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash 651328970, now seen corresponding path program 1 times [2025-03-17 06:01:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:12,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843487473] [2025-03-17 06:01:12,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:12,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:01:12,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:01:12,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:12,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:12,346 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-17 06:01:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843487473] [2025-03-17 06:01:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843487473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:01:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422579478] [2025-03-17 06:01:12,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:12,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:12,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:12,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:01:12,351 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-17 06:01:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:12,602 INFO L93 Difference]: Finished difference Result 371 states and 542 transitions. [2025-03-17 06:01:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 127 [2025-03-17 06:01:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:12,605 INFO L225 Difference]: With dead ends: 371 [2025-03-17 06:01:12,605 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 06:01:12,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:01:12,606 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:12,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 370 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:01:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 06:01:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 207. [2025-03-17 06:01:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3850574712643677) internal successors, (241), 174 states have internal predecessors, (241), 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-17 06:01:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 301 transitions. [2025-03-17 06:01:12,621 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 301 transitions. Word has length 127 [2025-03-17 06:01:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:12,621 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 301 transitions. [2025-03-17 06:01:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-17 06:01:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 301 transitions. [2025-03-17 06:01:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:01:12,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:12,625 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] [2025-03-17 06:01:12,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:01:12,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 242504745, now seen corresponding path program 1 times [2025-03-17 06:01:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112975602] [2025-03-17 06:01:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:12,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:01:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:01:12,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:12,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:13,151 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-17 06:01:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112975602] [2025-03-17 06:01:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112975602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:01:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344282673] [2025-03-17 06:01:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:01:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:13,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:01:13,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:01:13,153 INFO L87 Difference]: Start difference. First operand 207 states and 301 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-17 06:01:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:13,844 INFO L93 Difference]: Finished difference Result 477 states and 694 transitions. [2025-03-17 06:01:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:01:13,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 127 [2025-03-17 06:01:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:13,847 INFO L225 Difference]: With dead ends: 477 [2025-03-17 06:01:13,848 INFO L226 Difference]: Without dead ends: 371 [2025-03-17 06:01:13,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:01:13,850 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 199 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:13,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 609 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:01:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-17 06:01:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 207. [2025-03-17 06:01:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3850574712643677) internal successors, (241), 174 states have internal predecessors, (241), 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-17 06:01:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 301 transitions. [2025-03-17 06:01:13,874 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 301 transitions. Word has length 127 [2025-03-17 06:01:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:13,875 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 301 transitions. [2025-03-17 06:01:13,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-17 06:01:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 301 transitions. [2025-03-17 06:01:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:01:13,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:13,877 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] [2025-03-17 06:01:13,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:01:13,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2006341812, now seen corresponding path program 1 times [2025-03-17 06:01:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362794536] [2025-03-17 06:01:13,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:13,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:01:13,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:01:13,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:13,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:14,786 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-17 06:01:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:01:14,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362794536] [2025-03-17 06:01:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362794536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:01:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011964366] [2025-03-17 06:01:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:01:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:01:14,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:01:14,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:01:14,788 INFO L87 Difference]: Start difference. First operand 207 states and 301 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (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-17 06:01:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:15,230 INFO L93 Difference]: Finished difference Result 578 states and 840 transitions. [2025-03-17 06:01:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:01:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (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 127 [2025-03-17 06:01:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:15,232 INFO L225 Difference]: With dead ends: 578 [2025-03-17 06:01:15,232 INFO L226 Difference]: Without dead ends: 372 [2025-03-17 06:01:15,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-17 06:01:15,233 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 187 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:15,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 373 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:01:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-17 06:01:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 307. [2025-03-17 06:01:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 258 states have (on average 1.37984496124031) internal successors, (356), 258 states have internal predecessors, (356), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 06:01:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 446 transitions. [2025-03-17 06:01:15,258 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 446 transitions. Word has length 127 [2025-03-17 06:01:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:15,258 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 446 transitions. [2025-03-17 06:01:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (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-17 06:01:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2025-03-17 06:01:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:01:15,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:15,260 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] [2025-03-17 06:01:15,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:01:15,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:15,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807635, now seen corresponding path program 1 times [2025-03-17 06:01:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:01:15,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140764316] [2025-03-17 06:01:15,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:15,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:01:15,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:01:15,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:01:15,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:15,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:01:15,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:01:15,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:01:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:01:15,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:15,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:01:15,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:01:15,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:01:15,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:01:15,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:01:15,402 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:01:15,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:01:15,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:01:15 BoogieIcfgContainer [2025-03-17 06:01:15,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:01:15,446 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:01:15,446 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:01:15,446 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:01:15,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:01:05" (3/4) ... [2025-03-17 06:01:15,448 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:01:15,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:01:15,449 INFO L158 Benchmark]: Toolchain (without parser) took 11200.60ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 106.4MB in the beginning and 273.8MB in the end (delta: -167.3MB). Peak memory consumption was 226.5MB. Max. memory is 16.1GB. [2025-03-17 06:01:15,449 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:01:15,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.74ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 89.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:01:15,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.67ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 85.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:01:15,450 INFO L158 Benchmark]: Boogie Preprocessor took 51.20ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:01:15,450 INFO L158 Benchmark]: IcfgBuilder took 591.03ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 49.6MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:01:15,450 INFO L158 Benchmark]: TraceAbstraction took 10236.12ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 49.6MB in the beginning and 274.0MB in the end (delta: -224.3MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2025-03-17 06:01:15,450 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 536.9MB. Free memory was 274.0MB in the beginning and 273.8MB in the end (delta: 170.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:01:15,451 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.74ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 89.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.67ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 85.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.20ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 591.03ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 49.6MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10236.12ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 49.6MB in the beginning and 274.0MB in the end (delta: -224.3MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 536.9MB. Free memory was 274.0MB in the beginning and 273.8MB in the end (delta: 170.8kB). 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 111, overapproximation of someBinaryFLOATComparisonOperation at line 103, 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; [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, 103 locations, 169 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 781 mSDsluCounter, 3771 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2512 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2596 IncrementalHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 1259 mSDtfsCounter, 2596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=9, InterpolantAutomatonStates: 47, 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, 9 MinimizatonAttempts, 358 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1752 NumberOfCodeBlocks, 1752 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1612 ConstructedInterpolants, 0 QuantifiedInterpolants, 3032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1881 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 5306/5460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:01:15,467 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-?-8fc3dc6-m [2025-03-17 06:01:17,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:01:17,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:01:17,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:01:17,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:01:17,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:01:17,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:01:17,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:01:17,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:01:17,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:01:17,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:01:17,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:01:17,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:01:17,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:01:17,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:01:17,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:01:17,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:01:17,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:01:17,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:01:17,439 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-17 06:01:17,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:01:17,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:01:17,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:01:17,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:01:17,717 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:01:17,718 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-17 06:01:18,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23024e116/c69fd738dc484fc0a2b8774c375eb783/FLAGcac7df801 [2025-03-17 06:01:19,121 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:01:19,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2025-03-17 06:01:19,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23024e116/c69fd738dc484fc0a2b8774c375eb783/FLAGcac7df801 [2025-03-17 06:01:19,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23024e116/c69fd738dc484fc0a2b8774c375eb783 [2025-03-17 06:01:19,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:01:19,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:01:19,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:01:19,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:01:19,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:01:19,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe4e0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19, skipping insertion in model container [2025-03-17 06:01:19,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:01:19,598 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-17 06:01:19,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:01:19,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:01:19,664 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-17 06:01:19,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:01:19,721 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:01:19,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19 WrapperNode [2025-03-17 06:01:19,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:01:19,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:01:19,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:01:19,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:01:19,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,786 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-03-17 06:01:19,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:01:19,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:01:19,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:01:19,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:01:19,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,834 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-17 06:01:19,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:01:19,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:01:19,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:01:19,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:01:19,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (1/1) ... [2025-03-17 06:01:19,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:01:19,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:01:19,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:01:19,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:01:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:01:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:01:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:01:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:01:20,044 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:01:20,045 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:01:22,639 INFO L1322 $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-17 06:01:22,662 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 06:01:22,662 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:01:22,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:01:22,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:01:22,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:01:22 BoogieIcfgContainer [2025-03-17 06:01:22,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:01:22,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:01:22,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:01:22,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:01:22,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:01:19" (1/3) ... [2025-03-17 06:01:22,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325eb5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:01:22, skipping insertion in model container [2025-03-17 06:01:22,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:01:19" (2/3) ... [2025-03-17 06:01:22,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325eb5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:01:22, skipping insertion in model container [2025-03-17 06:01:22,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:01:22" (3/3) ... [2025-03-17 06:01:22,683 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2025-03-17 06:01:22,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:01:22,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-73.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:01:22,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:01:22,746 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;@61d170e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:01:22,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:01:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 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-17 06:01:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:01:22,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:22,761 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] [2025-03-17 06:01:22,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash 281557133, now seen corresponding path program 1 times [2025-03-17 06:01:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:22,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470368] [2025-03-17 06:01:22,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:22,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:22,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:22,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:22,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:01:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:23,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:23,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:23,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:23,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:01:23,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-17 06:01:23,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:23,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:23,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470368] [2025-03-17 06:01:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:01:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535020268] [2025-03-17 06:01:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:23,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:01:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:23,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:01:23,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:01:23,162 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-17 06:01:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:23,180 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-03-17 06:01:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:01:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 124 [2025-03-17 06:01:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:23,185 INFO L225 Difference]: With dead ends: 203 [2025-03-17 06:01:23,186 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 06:01:23,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:01:23,189 INFO L435 NwaCegarLoop]: 150 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, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:23,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 06:01:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 06:01:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 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-17 06:01:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 06:01:23,258 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 124 [2025-03-17 06:01:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:23,258 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 06:01:23,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-17 06:01:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-17 06:01:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:01:23,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:23,260 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] [2025-03-17 06:01:23,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:01:23,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:23,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:23,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1230818542, now seen corresponding path program 1 times [2025-03-17 06:01:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584809671] [2025-03-17 06:01:23,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:23,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:01:23,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:01:23,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:01:23,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:23,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:23,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:01:23,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:23,818 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-17 06:01:23,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:23,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584809671] [2025-03-17 06:01:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584809671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:01:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511499182] [2025-03-17 06:01:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:23,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:23,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:23,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:01:23,822 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:23,873 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2025-03-17 06:01:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-17 06:01:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:23,876 INFO L225 Difference]: With dead ends: 203 [2025-03-17 06:01:23,878 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 06:01:23,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:01:23,880 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:23,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 06:01:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 06:01:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 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-17 06:01:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 06:01:23,894 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 124 [2025-03-17 06:01:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:23,895 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 06:01:23,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 06:01:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 06:01:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:01:23,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:23,896 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] [2025-03-17 06:01:23,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:01:24,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:24,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:24,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1060582292, now seen corresponding path program 1 times [2025-03-17 06:01:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357095791] [2025-03-17 06:01:24,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:24,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:24,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:24,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:24,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:01:24,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:01:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:01:24,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:24,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:24,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:01:24,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:24,400 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-17 06:01:24,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:24,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357095791] [2025-03-17 06:01:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357095791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:01:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883467494] [2025-03-17 06:01:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:01:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:24,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:01:24,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:01:24,402 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-17 06:01:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:24,465 INFO L93 Difference]: Finished difference Result 210 states and 310 transitions. [2025-03-17 06:01:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:01:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 126 [2025-03-17 06:01:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:24,467 INFO L225 Difference]: With dead ends: 210 [2025-03-17 06:01:24,467 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 06:01:24,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-17 06:01:24,468 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 564 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-17 06:01:24,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 564 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 06:01:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 06:01:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 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-17 06:01:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 06:01:24,475 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 126 [2025-03-17 06:01:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:24,475 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 06:01:24,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-17 06:01:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 06:01:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:01:24,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:24,477 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] [2025-03-17 06:01:24,486 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-17 06:01:24,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:24,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:24,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -173078611, now seen corresponding path program 1 times [2025-03-17 06:01:24,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:24,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266578520] [2025-03-17 06:01:24,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:24,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:24,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:24,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:24,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:01:24,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:01:24,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:01:24,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:24,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:24,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:01:25,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:25,033 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-17 06:01:25,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:25,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266578520] [2025-03-17 06:01:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266578520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:01:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318172813] [2025-03-17 06:01:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:25,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:01:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:25,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:01:25,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:01:25,035 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (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-17 06:01:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:25,097 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-03-17 06:01:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:01:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (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 126 [2025-03-17 06:01:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:25,101 INFO L225 Difference]: With dead ends: 216 [2025-03-17 06:01:25,101 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:01:25,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:01:25,104 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 699 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-17 06:01:25,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 699 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:01:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:01:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:01:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 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-17 06:01:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2025-03-17 06:01:25,110 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 126 [2025-03-17 06:01:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:25,110 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2025-03-17 06:01:25,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (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-17 06:01:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2025-03-17 06:01:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:01:25,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:25,112 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] [2025-03-17 06:01:25,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:01:25,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:25,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:25,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:25,314 INFO L85 PathProgramCache]: Analyzing trace with hash -172155090, now seen corresponding path program 1 times [2025-03-17 06:01:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3316535] [2025-03-17 06:01:25,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:25,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:25,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:01:25,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:01:25,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:01:25,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:25,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:25,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:01:25,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:25,767 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-17 06:01:25,795 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-17 06:01:25,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:25,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3316535] [2025-03-17 06:01:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3316535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:01:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072625810] [2025-03-17 06:01:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:25,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:01:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:25,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:01:25,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:01:25,800 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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-17 06:01:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:28,826 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2025-03-17 06:01:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:01:28,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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 126 [2025-03-17 06:01:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:28,828 INFO L225 Difference]: With dead ends: 218 [2025-03-17 06:01:28,828 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:01:28,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 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-17 06:01:28,829 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 121 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:28,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 420 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 06:01:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:01:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:01:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 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-17 06:01:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 06:01:28,846 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 126 [2025-03-17 06:01:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:28,846 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 06:01:28,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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-17 06:01:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 06:01:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:01:28,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:28,849 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] [2025-03-17 06:01:28,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:01:29,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:29,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:29,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2051253964, now seen corresponding path program 1 times [2025-03-17 06:01:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609486607] [2025-03-17 06:01:29,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:29,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:29,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:29,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:29,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:01:29,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:01:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:01:29,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:29,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:29,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:01:29,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:29,576 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-17 06:01:29,601 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-17 06:01:29,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:29,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609486607] [2025-03-17 06:01:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609486607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:01:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249362511] [2025-03-17 06:01:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:01:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:29,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:01:29,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:01:29,603 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-17 06:01:30,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:01:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:32,775 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-17 06:01:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:01:32,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 128 [2025-03-17 06:01:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:32,777 INFO L225 Difference]: With dead ends: 218 [2025-03-17 06:01:32,777 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:01:32,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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-17 06:01:32,779 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:32,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 416 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-17 06:01:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:01:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:01:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 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-17 06:01:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-17 06:01:32,790 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 128 [2025-03-17 06:01:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:32,790 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-17 06:01:32,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-17 06:01:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-17 06:01:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:01:32,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:32,791 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] [2025-03-17 06:01:32,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:01:32,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:32,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:32,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2141679186, now seen corresponding path program 1 times [2025-03-17 06:01:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854669427] [2025-03-17 06:01:32,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:32,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:32,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:32,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:01:33,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:01:33,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:01:33,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:33,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:33,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:01:33,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:33,365 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-17 06:01:33,398 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-17 06:01:33,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:33,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854669427] [2025-03-17 06:01:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854669427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:33,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:33,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:01:33,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141119336] [2025-03-17 06:01:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:33,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:33,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:33,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:33,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:01:33,399 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (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-17 06:01:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:35,443 INFO L93 Difference]: Finished difference Result 219 states and 314 transitions. [2025-03-17 06:01:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (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 130 [2025-03-17 06:01:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:35,444 INFO L225 Difference]: With dead ends: 219 [2025-03-17 06:01:35,444 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:01:35,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:01:35,445 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:35,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 06:01:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:01:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 06:01:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 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-17 06:01:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-03-17 06:01:35,450 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 130 [2025-03-17 06:01:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:35,450 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-03-17 06:01:35,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (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-17 06:01:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-03-17 06:01:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:01:35,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:35,452 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] [2025-03-17 06:01:35,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:01:35,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:35,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:35,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1744463885, now seen corresponding path program 1 times [2025-03-17 06:01:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:35,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723264322] [2025-03-17 06:01:35,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:35,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:35,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:35,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:01:35,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:01:35,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:01:35,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:35,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:35,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:01:35,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:36,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:36,052 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-17 06:01:36,084 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-17 06:01:36,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:01:36,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723264322] [2025-03-17 06:01:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723264322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:01:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:01:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:01:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151761020] [2025-03-17 06:01:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:36,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:01:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:36,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:01:36,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:01:36,085 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-17 06:01:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:39,482 INFO L93 Difference]: Finished difference Result 221 states and 315 transitions. [2025-03-17 06:01:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:01:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 130 [2025-03-17 06:01:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:39,486 INFO L225 Difference]: With dead ends: 221 [2025-03-17 06:01:39,487 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:01:39,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-17 06:01:39,488 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:39,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 06:01:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:01:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-03-17 06:01:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 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-17 06:01:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-17 06:01:39,500 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 130 [2025-03-17 06:01:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:39,500 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-17 06:01:39,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-17 06:01:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-17 06:01:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:01:39,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:39,501 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-17 06:01:39,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 06:01:39,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:39,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:39,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:39,702 INFO L85 PathProgramCache]: Analyzing trace with hash -442052430, now seen corresponding path program 1 times [2025-03-17 06:01:39,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:39,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656093887] [2025-03-17 06:01:39,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:39,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:01:39,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 06:01:39,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:01:40,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:01:40,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:40,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:40,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 06:01:40,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:40,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:40,194 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 103 treesize of output 52 [2025-03-17 06:01:40,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:40,258 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 67 [2025-03-17 06:01:40,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:40,556 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 77 treesize of output 77 [2025-03-17 06:01:42,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:42,671 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-17 06:01:43,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:43,014 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 71 [2025-03-17 06:01:45,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:45,509 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 67 [2025-03-17 06:01:45,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:45,778 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 66 treesize of output 77 [2025-03-17 06:01:46,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:46,101 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-17 06:01:46,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:46,364 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-17 06:01:46,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:46,621 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 81 [2025-03-17 06:01:46,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:46,997 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-17 06:01:47,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:47,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 81 [2025-03-17 06:01:47,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:47,091 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 92 treesize of output 38 [2025-03-17 06:01:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 84 proven. 264 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 06:01:47,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:01:47,272 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-17 06:01:47,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656093887] [2025-03-17 06:01:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656093887] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:01:47,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:01:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-17 06:01:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736432571] [2025-03-17 06:01:47,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:47,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:47,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=83, Unknown=2, NotChecked=0, Total=110 [2025-03-17 06:01:47,274 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-17 06:01:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:01:50,004 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2025-03-17 06:01:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:01:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-17 06:01:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:01:50,007 INFO L225 Difference]: With dead ends: 274 [2025-03-17 06:01:50,007 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 06:01:50,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=29, Invalid=101, Unknown=2, NotChecked=0, Total=132 [2025-03-17 06:01:50,008 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 126 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:01:50,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 358 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 06:01:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 06:01:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-17 06:01:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 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-17 06:01:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-03-17 06:01:50,019 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 131 [2025-03-17 06:01:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:01:50,019 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-03-17 06:01:50,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-17 06:01:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-03-17 06:01:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:01:50,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:01:50,020 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-17 06:01:50,033 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-17 06:01:50,220 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-17 06:01:50,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:01:50,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:01:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash -230701517, now seen corresponding path program 1 times [2025-03-17 06:01:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:01:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637610736] [2025-03-17 06:01:50,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:01:50,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:01:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:01:50,223 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-17 06:01:50,224 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-17 06:01:50,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:01:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:01:50,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:01:50,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:01:50,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 06:01:50,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:01:50,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:01:50,713 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 119 treesize of output 21 [2025-03-17 06:01:50,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:50,732 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 40 treesize of output 27 [2025-03-17 06:01:50,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:50,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 [2025-03-17 06:01:52,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:52,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-17 06:01:52,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:52,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-17 06:01:52,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:52,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-17 06:01:53,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:53,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 44 [2025-03-17 06:01:57,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:57,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-17 06:01:57,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:57,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-17 06:01:57,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:57,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-17 06:01:57,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:57,871 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 72 treesize of output 77 [2025-03-17 06:01:57,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:57,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 81 [2025-03-17 06:01:58,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:58,103 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 89 treesize of output 81 [2025-03-17 06:01:58,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:01:58,151 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 92 treesize of output 38 [2025-03-17 06:01:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 112 proven. 224 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 06:01:58,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:01:58,324 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-17 06:01:58,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:01:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637610736] [2025-03-17 06:01:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637610736] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:01:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:01:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-17 06:01:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480779416] [2025-03-17 06:01:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:01:58,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:01:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:01:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:01:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=79, Unknown=2, NotChecked=0, Total=110 [2025-03-17 06:01:58,326 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-17 06:02:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:00,537 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2025-03-17 06:02:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:00,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-17 06:02:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:00,539 INFO L225 Difference]: With dead ends: 274 [2025-03-17 06:02:00,539 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 06:02:00,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=33, Invalid=97, Unknown=2, NotChecked=0, Total=132 [2025-03-17 06:02:00,540 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 121 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:00,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 357 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 06:02:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 06:02:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-17 06:02:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 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-17 06:02:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2025-03-17 06:02:00,546 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 131 [2025-03-17 06:02:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2025-03-17 06:02:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (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-17 06:02:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2025-03-17 06:02:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:02:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:00,547 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-17 06:02:00,560 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-17 06:02:00,747 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-17 06:02:00,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:00,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash -741235694, now seen corresponding path program 1 times [2025-03-17 06:02:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197379702] [2025-03-17 06:02:00,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:00,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:00,751 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-17 06:02:00,752 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-17 06:02:00,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:02:01,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:02:01,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:01,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:01,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 06:02:01,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:02:01,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:01,554 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-17 06:02:01,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:01,737 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-17 06:02:01,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:01,893 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-17 06:02:02,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:02,051 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-17 06:02:02,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:02,231 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 137 treesize of output 82 [2025-03-17 06:02:02,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:02,464 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 152 treesize of output 85 [2025-03-17 06:02:02,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:02,660 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 147 treesize of output 95 [2025-03-17 06:02:03,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:03,061 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 164 treesize of output 118 [2025-03-17 06:02:03,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:03,191 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 179 treesize of output 121 [2025-03-17 06:02:03,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:03,330 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 235 treesize of output 160 [2025-03-17 06:02:03,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:03,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 254 treesize of output 166 [2025-03-17 06:02:03,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:03,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 431 treesize of output 151 [2025-03-17 06:02:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 212 proven. 104 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 06:02:03,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:02:03,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197379702] [2025-03-17 06:02:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197379702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [147432557] [2025-03-17 06:02:03,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:03,926 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:02:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:02:03,929 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-17 06:02:03,930 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-17 06:02:04,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:02:05,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:02:05,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:05,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:05,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 06:02:05,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:05,715 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-17 06:02:06,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:06,383 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-17 06:02:06,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:06,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2025-03-17 06:02:07,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:07,064 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 48 treesize of output 45 [2025-03-17 06:02:07,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:07,294 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 48 treesize of output 45 [2025-03-17 06:02:07,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:07,517 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 45 treesize of output 53 [2025-03-17 06:02:07,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:07,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2025-03-17 06:02:08,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:08,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 64 [2025-03-17 06:02:08,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:08,789 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 66 treesize of output 83 [2025-03-17 06:02:09,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 86 [2025-03-17 06:02:09,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:09,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 123 treesize of output 123 [2025-03-17 06:02:09,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:09,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 138 treesize of output 129 [2025-03-17 06:02:09,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:09,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 283 treesize of output 123 [2025-03-17 06:02:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 252 proven. 104 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 06:02:09,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:02:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [147432557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:09,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:02:09,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2025-03-17 06:02:09,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292152575] [2025-03-17 06:02:09,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:02:09,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 06:02:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:09,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 06:02:09,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:02:09,851 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 25 states have internal predecessors, (132), 11 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-17 06:02:15,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:02:16,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:02:28,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:02:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:31,463 INFO L93 Difference]: Finished difference Result 345 states and 472 transitions. [2025-03-17 06:02:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 06:02:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 25 states have internal predecessors, (132), 11 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 131 [2025-03-17 06:02:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:31,465 INFO L225 Difference]: With dead ends: 345 [2025-03-17 06:02:31,465 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 06:02:31,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=374, Invalid=1606, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 06:02:31,466 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 636 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:31,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 528 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2025-03-17 06:02:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 06:02:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2025-03-17 06:02:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.3089005235602094) internal successors, (250), 193 states have internal predecessors, (250), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 06:02:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 314 transitions. [2025-03-17 06:02:31,485 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 314 transitions. Word has length 131 [2025-03-17 06:02:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:31,485 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 314 transitions. [2025-03-17 06:02:31,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 25 states have internal predecessors, (132), 11 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-17 06:02:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 314 transitions. [2025-03-17 06:02:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:02:31,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:31,486 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-17 06:02:31,501 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-17 06:02:31,699 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-17 06:02:31,887 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-17 06:02:31,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 545246611, now seen corresponding path program 1 times [2025-03-17 06:02:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276713779] [2025-03-17 06:02:31,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:31,890 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-17 06:02:31,891 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-17 06:02:31,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:02:32,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:02:32,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:32,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:32,165 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-17 06:02:32,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:32,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:32,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276713779] [2025-03-17 06:02:32,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276713779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:32,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:32,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:32,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034164697] [2025-03-17 06:02:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:32,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:32,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:32,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:32,167 INFO L87 Difference]: Start difference. First operand 231 states and 314 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-17 06:02:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:32,233 INFO L93 Difference]: Finished difference Result 457 states and 621 transitions. [2025-03-17 06:02:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-17 06:02:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:32,236 INFO L225 Difference]: With dead ends: 457 [2025-03-17 06:02:32,236 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 06:02:32,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:32,236 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:32,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 06:02:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-17 06:02:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 193 states have internal predecessors, (249), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 06:02:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 313 transitions. [2025-03-17 06:02:32,269 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 313 transitions. Word has length 131 [2025-03-17 06:02:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:32,269 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 313 transitions. [2025-03-17 06:02:32,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-17 06:02:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 313 transitions. [2025-03-17 06:02:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:02:32,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:32,270 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-17 06:02:32,280 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-17 06:02:32,471 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-17 06:02:32,471 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:32,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1939224753, now seen corresponding path program 1 times [2025-03-17 06:02:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711194516] [2025-03-17 06:02:32,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:32,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:32,474 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-17 06:02:32,475 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-17 06:02:32,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:02:32,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:02:32,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:02:32,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-17 06:02:32,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:32,788 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711194516] [2025-03-17 06:02:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711194516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:32,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874706852] [2025-03-17 06:02:32,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:32,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:32,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:32,789 INFO L87 Difference]: Start difference. First operand 231 states and 313 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:02:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:32,918 INFO L93 Difference]: Finished difference Result 471 states and 634 transitions. [2025-03-17 06:02:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:02:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2025-03-17 06:02:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:32,920 INFO L225 Difference]: With dead ends: 471 [2025-03-17 06:02:32,920 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 06:02:32,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:32,921 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:32,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 595 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 06:02:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2025-03-17 06:02:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.2984293193717278) internal successors, (248), 193 states have internal predecessors, (248), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 06:02:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 312 transitions. [2025-03-17 06:02:32,940 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 312 transitions. Word has length 133 [2025-03-17 06:02:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:32,942 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 312 transitions. [2025-03-17 06:02:32,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:02:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 312 transitions. [2025-03-17 06:02:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:02:32,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:32,944 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-17 06:02:32,956 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 (15)] Ended with exit code 0 [2025-03-17 06:02:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:33,144 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:33,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 374580464, now seen corresponding path program 1 times [2025-03-17 06:02:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046400782] [2025-03-17 06:02:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:33,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:33,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:33,149 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 (16)] Waiting until timeout for monitored process [2025-03-17 06:02:33,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:02:33,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:02:33,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:02:33,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:33,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:02:34,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:34,020 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 130 treesize of output 57 [2025-03-17 06:02:34,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:34,124 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-17 06:02:34,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:34,299 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-17 06:02:34,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:34,438 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-17 06:02:34,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:34,575 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