./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:48:05,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:48:05,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:48:05,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:48:05,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:48:05,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:48:05,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:48:05,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:48:05,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:48:05,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:48:05,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:48:05,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:48:05,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:48:05,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:48:05,195 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:48:05,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:48:05,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:48:05,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:48:05,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:48:05,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:48:05,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:48:05,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:48:05,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:48:05,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:05,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:48:05,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:48:05,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:48:05,199 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-jdk21/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 -> 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d [2025-02-06 03:48:05,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:48:05,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:48:05,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:48:05,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:48:05,415 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:48:05,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2025-02-06 03:48:06,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0268ad8f/ae4c3bac56dd4fef83866d6cff922a60/FLAGa08c6e35e [2025-02-06 03:48:06,882 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:48:06,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2025-02-06 03:48:06,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0268ad8f/ae4c3bac56dd4fef83866d6cff922a60/FLAGa08c6e35e [2025-02-06 03:48:07,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0268ad8f/ae4c3bac56dd4fef83866d6cff922a60 [2025-02-06 03:48:07,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:48:07,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:48:07,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:07,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:48:07,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:48:07,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b657fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07, skipping insertion in model container [2025-02-06 03:48:07,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:48:07,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i[916,929] [2025-02-06 03:48:07,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:07,332 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:48:07,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i[916,929] [2025-02-06 03:48:07,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:07,383 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:48:07,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07 WrapperNode [2025-02-06 03:48:07,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:07,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:07,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:48:07,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:48:07,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,446 INFO L138 Inliner]: procedures = 30, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2025-02-06 03:48:07,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:07,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:48:07,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:48:07,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:48:07,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,463 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:48:07,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:48:07,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:48:07,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:48:07,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:48:07,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (1/1) ... [2025-02-06 03:48:07,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:07,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:48:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:48:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:48:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:48:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:48:07,635 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:48:07,636 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:48:08,130 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite160#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite157#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem156#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite145#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite155#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-02-06 03:48:08,168 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-02-06 03:48:08,169 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:48:08,181 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:48:08,181 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:48:08,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:08 BoogieIcfgContainer [2025-02-06 03:48:08,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:48:08,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:48:08,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:48:08,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:48:08,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:48:07" (1/3) ... [2025-02-06 03:48:08,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5287251a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:08, skipping insertion in model container [2025-02-06 03:48:08,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:07" (2/3) ... [2025-02-06 03:48:08,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5287251a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:08, skipping insertion in model container [2025-02-06 03:48:08,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:08" (3/3) ... [2025-02-06 03:48:08,197 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-14.i [2025-02-06 03:48:08,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:48:08,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-14.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:48:08,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:48:08,264 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;@38dacfff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:48:08,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:48:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:48:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:08,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:08,277 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:08,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:08,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -971381059, now seen corresponding path program 1 times [2025-02-06 03:48:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:08,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668464272] [2025-02-06 03:48:08,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:08,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 03:48:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668464272] [2025-02-06 03:48:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668464272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600625413] [2025-02-06 03:48:08,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:08,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:08,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:08,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:08,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:48:08,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:08,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:08,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:08,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:48:08,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 03:48:08,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600625413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:48:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:48:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977221273] [2025-02-06 03:48:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:48:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:48:08,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:48:08,925 INFO L87 Difference]: Start difference. First operand has 127 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:08,952 INFO L93 Difference]: Finished difference Result 248 states and 392 transitions. [2025-02-06 03:48:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:48:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-02-06 03:48:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:08,960 INFO L225 Difference]: With dead ends: 248 [2025-02-06 03:48:08,960 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:48:08,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-02-06 03:48:08,967 INFO L435 NwaCegarLoop]: 183 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, 183 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-02-06 03:48:08,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:48:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 03:48:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:48:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-02-06 03:48:09,006 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2025-02-06 03:48:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:09,006 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-02-06 03:48:09,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-02-06 03:48:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:09,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:09,009 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:09,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:48:09,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:48:09,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:09,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash 382591566, now seen corresponding path program 1 times [2025-02-06 03:48:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:09,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56803689] [2025-02-06 03:48:09,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:09,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:09,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:09,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56803689] [2025-02-06 03:48:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56803689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:10,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868432888] [2025-02-06 03:48:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:10,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:10,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:10,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:10,465 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:10,789 INFO L93 Difference]: Finished difference Result 367 states and 544 transitions. [2025-02-06 03:48:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-02-06 03:48:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:10,792 INFO L225 Difference]: With dead ends: 367 [2025-02-06 03:48:10,792 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 03:48:10,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-06 03:48:10,793 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 168 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:10,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 403 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 03:48:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 218. [2025-02-06 03:48:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:48:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 323 transitions. [2025-02-06 03:48:10,816 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 323 transitions. Word has length 168 [2025-02-06 03:48:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:10,817 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 323 transitions. [2025-02-06 03:48:10,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2025-02-06 03:48:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:10,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:10,819 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:10,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:48:10,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:10,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash 315584813, now seen corresponding path program 1 times [2025-02-06 03:48:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735242160] [2025-02-06 03:48:10,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:10,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:10,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:10,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:10,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735242160] [2025-02-06 03:48:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735242160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:11,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872568131] [2025-02-06 03:48:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:11,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:48:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:11,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:48:11,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:48:11,232 INFO L87 Difference]: Start difference. First operand 218 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:11,530 INFO L93 Difference]: Finished difference Result 452 states and 669 transitions. [2025-02-06 03:48:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-02-06 03:48:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:11,533 INFO L225 Difference]: With dead ends: 452 [2025-02-06 03:48:11,533 INFO L226 Difference]: Without dead ends: 331 [2025-02-06 03:48:11,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:11,534 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 134 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:11,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 878 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-06 03:48:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 228. [2025-02-06 03:48:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 183 states have (on average 1.3825136612021858) internal successors, (253), 183 states have internal predecessors, (253), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:48:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 337 transitions. [2025-02-06 03:48:11,550 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 337 transitions. Word has length 168 [2025-02-06 03:48:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:11,551 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 337 transitions. [2025-02-06 03:48:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2025-02-06 03:48:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:11,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:11,552 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:11,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:48:11,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:11,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash -189973812, now seen corresponding path program 1 times [2025-02-06 03:48:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:11,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009676722] [2025-02-06 03:48:11,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:11,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:11,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:11,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009676722] [2025-02-06 03:48:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009676722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:12,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884312768] [2025-02-06 03:48:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:12,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:48:12,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:12,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:48:12,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:48:12,077 INFO L87 Difference]: Start difference. First operand 228 states and 337 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:12,425 INFO L93 Difference]: Finished difference Result 364 states and 539 transitions. [2025-02-06 03:48:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:48:12,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-02-06 03:48:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:12,428 INFO L225 Difference]: With dead ends: 364 [2025-02-06 03:48:12,429 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:48:12,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-06 03:48:12,430 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 164 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:12,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 258 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:48:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-06 03:48:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3783783783783783) internal successors, (255), 185 states have internal predecessors, (255), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:48:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2025-02-06 03:48:12,456 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 168 [2025-02-06 03:48:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:12,456 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2025-02-06 03:48:12,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2025-02-06 03:48:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:12,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:12,458 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:12,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:48:12,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1317577997, now seen corresponding path program 1 times [2025-02-06 03:48:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147599170] [2025-02-06 03:48:12,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:12,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:12,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147599170] [2025-02-06 03:48:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147599170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010586110] [2025-02-06 03:48:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:12,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:12,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:12,930 INFO L87 Difference]: Start difference. First operand 230 states and 339 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:13,414 INFO L93 Difference]: Finished difference Result 486 states and 717 transitions. [2025-02-06 03:48:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-02-06 03:48:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:13,417 INFO L225 Difference]: With dead ends: 486 [2025-02-06 03:48:13,417 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 03:48:13,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:48:13,418 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 493 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:13,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 296 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:48:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 03:48:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 226. [2025-02-06 03:48:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.3535911602209945) internal successors, (245), 181 states have internal predecessors, (245), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:48:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2025-02-06 03:48:13,445 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 168 [2025-02-06 03:48:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:13,445 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2025-02-06 03:48:13,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2025-02-06 03:48:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 03:48:13,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:13,449 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:13,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:48:13,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:13,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1104118422, now seen corresponding path program 1 times [2025-02-06 03:48:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:13,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716209148] [2025-02-06 03:48:13,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:13,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 03:48:13,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 03:48:13,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:13,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 03:48:14,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716209148] [2025-02-06 03:48:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716209148] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800156608] [2025-02-06 03:48:14,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:14,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:14,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:14,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:14,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:48:14,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 03:48:14,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 03:48:14,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:14,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:48:14,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:14,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2025-02-06 03:48:14,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:14,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 45 [2025-02-06 03:48:14,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 46 treesize of output 47 [2025-02-06 03:48:15,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:15,006 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 125 treesize of output 82 [2025-02-06 03:48:15,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:15,140 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 140 treesize of output 85 [2025-02-06 03:48:15,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:15,217 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 138 treesize of output 92 [2025-02-06 03:48:15,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:15,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 413 treesize of output 191 [2025-02-06 03:48:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 03:48:15,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:48:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800156608] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:15,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:48:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 10] total 15 [2025-02-06 03:48:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138311912] [2025-02-06 03:48:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:15,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:15,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:15,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:48:15,949 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:16,375 INFO L93 Difference]: Finished difference Result 427 states and 619 transitions. [2025-02-06 03:48:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2025-02-06 03:48:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:16,377 INFO L225 Difference]: With dead ends: 427 [2025-02-06 03:48:16,377 INFO L226 Difference]: Without dead ends: 302 [2025-02-06 03:48:16,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:48:16,377 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 80 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:16,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 700 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-06 03:48:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2025-02-06 03:48:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 247 states have (on average 1.3643724696356276) internal successors, (337), 248 states have internal predecessors, (337), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:48:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 433 transitions. [2025-02-06 03:48:16,396 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 433 transitions. Word has length 170 [2025-02-06 03:48:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 433 transitions. [2025-02-06 03:48:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 433 transitions. [2025-02-06 03:48:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 03:48:16,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:16,398 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:16,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:48:16,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:16,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1277801519, now seen corresponding path program 1 times [2025-02-06 03:48:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294526725] [2025-02-06 03:48:16,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:16,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 03:48:16,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 03:48:16,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:16,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294526725] [2025-02-06 03:48:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294526725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:18,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:18,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:48:18,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764474155] [2025-02-06 03:48:18,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:18,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:48:18,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:18,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:48:18,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:48:18,037 INFO L87 Difference]: Start difference. First operand 299 states and 433 transitions. Second operand has 11 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:19,164 INFO L93 Difference]: Finished difference Result 867 states and 1220 transitions. [2025-02-06 03:48:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:48:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2025-02-06 03:48:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:19,168 INFO L225 Difference]: With dead ends: 867 [2025-02-06 03:48:19,169 INFO L226 Difference]: Without dead ends: 669 [2025-02-06 03:48:19,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:48:19,171 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 264 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:19,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1141 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:48:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-02-06 03:48:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 469. [2025-02-06 03:48:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 398 states have (on average 1.3467336683417086) internal successors, (536), 401 states have internal predecessors, (536), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:48:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 664 transitions. [2025-02-06 03:48:19,205 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 664 transitions. Word has length 175 [2025-02-06 03:48:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:19,206 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 664 transitions. [2025-02-06 03:48:19,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 664 transitions. [2025-02-06 03:48:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 03:48:19,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:19,208 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:48:19,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1175621553, now seen corresponding path program 1 times [2025-02-06 03:48:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415623679] [2025-02-06 03:48:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:19,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 03:48:19,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 03:48:19,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:19,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415623679] [2025-02-06 03:48:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415623679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646369405] [2025-02-06 03:48:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:19,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:19,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:19,612 INFO L87 Difference]: Start difference. First operand 469 states and 664 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:20,082 INFO L93 Difference]: Finished difference Result 1099 states and 1552 transitions. [2025-02-06 03:48:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:20,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 175 [2025-02-06 03:48:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:20,085 INFO L225 Difference]: With dead ends: 1099 [2025-02-06 03:48:20,085 INFO L226 Difference]: Without dead ends: 728 [2025-02-06 03:48:20,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:48:20,087 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 350 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:20,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 465 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:48:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-02-06 03:48:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 469. [2025-02-06 03:48:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 398 states have (on average 1.3015075376884422) internal successors, (518), 401 states have internal predecessors, (518), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:48:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 646 transitions. [2025-02-06 03:48:20,122 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 646 transitions. Word has length 175 [2025-02-06 03:48:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:20,123 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 646 transitions. [2025-02-06 03:48:20,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 646 transitions. [2025-02-06 03:48:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 03:48:20,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:20,125 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:20,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:48:20,125 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash -651083823, now seen corresponding path program 1 times [2025-02-06 03:48:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:20,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495253601] [2025-02-06 03:48:20,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:20,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 03:48:20,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 03:48:20,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:20,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495253601] [2025-02-06 03:48:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495253601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:21,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:48:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717076883] [2025-02-06 03:48:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:48:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:21,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:48:21,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:21,248 INFO L87 Difference]: Start difference. First operand 469 states and 646 transitions. Second operand has 10 states, 8 states have (on average 9.125) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 03:48:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:21,840 INFO L93 Difference]: Finished difference Result 907 states and 1249 transitions. [2025-02-06 03:48:21,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:48:21,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.125) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 175 [2025-02-06 03:48:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:21,843 INFO L225 Difference]: With dead ends: 907 [2025-02-06 03:48:21,843 INFO L226 Difference]: Without dead ends: 559 [2025-02-06 03:48:21,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:48:21,844 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 201 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:21,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1050 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:48:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-06 03:48:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 443. [2025-02-06 03:48:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 372 states have (on average 1.2956989247311828) internal successors, (482), 375 states have internal predecessors, (482), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:48:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 610 transitions. [2025-02-06 03:48:21,865 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 610 transitions. Word has length 175 [2025-02-06 03:48:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:21,865 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 610 transitions. [2025-02-06 03:48:21,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.125) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-06 03:48:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 610 transitions. [2025-02-06 03:48:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:21,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:21,866 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:21,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:48:21,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:21,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 733449198, now seen corresponding path program 1 times [2025-02-06 03:48:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901500607] [2025-02-06 03:48:21,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:21,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:21,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:21,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:21,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:22,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:22,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901500607] [2025-02-06 03:48:22,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901500607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:22,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:22,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267087278] [2025-02-06 03:48:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:22,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:22,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:22,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:22,919 INFO L87 Difference]: Start difference. First operand 443 states and 610 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:23,344 INFO L93 Difference]: Finished difference Result 895 states and 1227 transitions. [2025-02-06 03:48:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:23,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-02-06 03:48:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:23,348 INFO L225 Difference]: With dead ends: 895 [2025-02-06 03:48:23,349 INFO L226 Difference]: Without dead ends: 570 [2025-02-06 03:48:23,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:23,350 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 47 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:23,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 733 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:48:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-06 03:48:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 566. [2025-02-06 03:48:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 489 states have (on average 1.2924335378323109) internal successors, (632), 494 states have internal predecessors, (632), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:48:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 768 transitions. [2025-02-06 03:48:23,377 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 768 transitions. Word has length 177 [2025-02-06 03:48:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:23,377 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 768 transitions. [2025-02-06 03:48:23,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 768 transitions. [2025-02-06 03:48:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:23,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:23,380 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:23,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:48:23,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:23,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1692802382, now seen corresponding path program 1 times [2025-02-06 03:48:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:23,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250073976] [2025-02-06 03:48:23,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:23,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:23,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:24,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250073976] [2025-02-06 03:48:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250073976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:24,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:48:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348096107] [2025-02-06 03:48:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:24,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:24,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:24,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:24,449 INFO L87 Difference]: Start difference. First operand 566 states and 768 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:24,722 INFO L93 Difference]: Finished difference Result 1012 states and 1367 transitions. [2025-02-06 03:48:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-02-06 03:48:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:24,725 INFO L225 Difference]: With dead ends: 1012 [2025-02-06 03:48:24,726 INFO L226 Difference]: Without dead ends: 580 [2025-02-06 03:48:24,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:48:24,727 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 49 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:24,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 581 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-06 03:48:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2025-02-06 03:48:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 498 states have (on average 1.283132530120482) internal successors, (639), 503 states have internal predecessors, (639), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:48:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2025-02-06 03:48:24,752 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 177 [2025-02-06 03:48:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:24,753 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2025-02-06 03:48:24,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2025-02-06 03:48:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:24,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:24,755 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:24,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:48:24,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:24,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash -89462525, now seen corresponding path program 1 times [2025-02-06 03:48:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541229277] [2025-02-06 03:48:24,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:24,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541229277] [2025-02-06 03:48:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541229277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:48:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631715384] [2025-02-06 03:48:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:48:26,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:26,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:48:26,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:48:26,212 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:27,224 INFO L93 Difference]: Finished difference Result 1118 states and 1474 transitions. [2025-02-06 03:48:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:48:27,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-02-06 03:48:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:27,228 INFO L225 Difference]: With dead ends: 1118 [2025-02-06 03:48:27,228 INFO L226 Difference]: Without dead ends: 1116 [2025-02-06 03:48:27,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:48:27,229 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 489 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:27,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 847 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:48:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-06 03:48:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1102. [2025-02-06 03:48:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 955 states have (on average 1.2659685863874346) internal successors, (1209), 966 states have internal predecessors, (1209), 123 states have call successors, (123), 23 states have call predecessors, (123), 23 states have return successors, (123), 112 states have call predecessors, (123), 123 states have call successors, (123) [2025-02-06 03:48:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1455 transitions. [2025-02-06 03:48:27,317 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1455 transitions. Word has length 177 [2025-02-06 03:48:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1455 transitions. [2025-02-06 03:48:27,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1455 transitions. [2025-02-06 03:48:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:27,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:27,320 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:48:27,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -104148977, now seen corresponding path program 1 times [2025-02-06 03:48:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357730216] [2025-02-06 03:48:27,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:27,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:27,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:27,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:28,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357730216] [2025-02-06 03:48:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357730216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:48:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246466217] [2025-02-06 03:48:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:48:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:28,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:48:28,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:48:28,466 INFO L87 Difference]: Start difference. First operand 1102 states and 1455 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:28,871 INFO L93 Difference]: Finished difference Result 2035 states and 2695 transitions. [2025-02-06 03:48:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:48:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-02-06 03:48:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:28,875 INFO L225 Difference]: With dead ends: 2035 [2025-02-06 03:48:28,875 INFO L226 Difference]: Without dead ends: 1120 [2025-02-06 03:48:28,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:28,877 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 93 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:28,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 725 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:48:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-02-06 03:48:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1118. [2025-02-06 03:48:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 971 states have (on average 1.2615859938208034) internal successors, (1225), 982 states have internal predecessors, (1225), 123 states have call successors, (123), 23 states have call predecessors, (123), 23 states have return successors, (123), 112 states have call predecessors, (123), 123 states have call successors, (123) [2025-02-06 03:48:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1471 transitions. [2025-02-06 03:48:28,920 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1471 transitions. Word has length 177 [2025-02-06 03:48:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1471 transitions. [2025-02-06 03:48:28,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1471 transitions. [2025-02-06 03:48:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:28,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:28,921 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:48:28,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -397551984, now seen corresponding path program 1 times [2025-02-06 03:48:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945154926] [2025-02-06 03:48:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:28,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:28,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:28,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:28,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945154926] [2025-02-06 03:48:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945154926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:48:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562387086] [2025-02-06 03:48:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:29,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:48:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:29,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:48:29,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:48:29,858 INFO L87 Difference]: Start difference. First operand 1118 states and 1471 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:30,932 INFO L93 Difference]: Finished difference Result 2455 states and 3221 transitions. [2025-02-06 03:48:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:48:30,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-02-06 03:48:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:30,938 INFO L225 Difference]: With dead ends: 2455 [2025-02-06 03:48:30,938 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 03:48:30,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:48:30,940 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 903 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:30,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 540 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:48:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 03:48:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1146. [2025-02-06 03:48:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1020 states have (on average 1.2558823529411764) internal successors, (1281), 1028 states have internal predecessors, (1281), 105 states have call successors, (105), 20 states have call predecessors, (105), 20 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:48:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1491 transitions. [2025-02-06 03:48:30,986 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1491 transitions. Word has length 177 [2025-02-06 03:48:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:30,986 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1491 transitions. [2025-02-06 03:48:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1491 transitions. [2025-02-06 03:48:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:30,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:30,988 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:30,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:48:30,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1695063215, now seen corresponding path program 1 times [2025-02-06 03:48:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252933085] [2025-02-06 03:48:30,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:31,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:31,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:31,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:31,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:32,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:32,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252933085] [2025-02-06 03:48:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252933085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:32,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:32,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:48:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232098070] [2025-02-06 03:48:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:32,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:48:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:32,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:48:32,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:48:32,160 INFO L87 Difference]: Start difference. First operand 1146 states and 1491 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:32,607 INFO L93 Difference]: Finished difference Result 2429 states and 3164 transitions. [2025-02-06 03:48:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:48:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2025-02-06 03:48:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:32,614 INFO L225 Difference]: With dead ends: 2429 [2025-02-06 03:48:32,614 INFO L226 Difference]: Without dead ends: 1496 [2025-02-06 03:48:32,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:48:32,616 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 43 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:32,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 984 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:48:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-02-06 03:48:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1324. [2025-02-06 03:48:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1198 states have (on average 1.2404006677796326) internal successors, (1486), 1206 states have internal predecessors, (1486), 105 states have call successors, (105), 20 states have call predecessors, (105), 20 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:48:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1696 transitions. [2025-02-06 03:48:32,660 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1696 transitions. Word has length 177 [2025-02-06 03:48:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:32,660 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1696 transitions. [2025-02-06 03:48:32,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1696 transitions. [2025-02-06 03:48:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:32,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:32,661 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:32,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:48:32,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash 295549713, now seen corresponding path program 1 times [2025-02-06 03:48:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35502005] [2025-02-06 03:48:32,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:32,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:32,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:32,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35502005] [2025-02-06 03:48:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35502005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:48:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319470680] [2025-02-06 03:48:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:32,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:32,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:32,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:32,739 INFO L87 Difference]: Start difference. First operand 1324 states and 1696 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:32,782 INFO L93 Difference]: Finished difference Result 2287 states and 2950 transitions. [2025-02-06 03:48:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:48:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2025-02-06 03:48:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:32,788 INFO L225 Difference]: With dead ends: 2287 [2025-02-06 03:48:32,788 INFO L226 Difference]: Without dead ends: 1161 [2025-02-06 03:48:32,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:32,789 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:32,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-02-06 03:48:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2025-02-06 03:48:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1035 states have (on average 1.2367149758454106) internal successors, (1280), 1043 states have internal predecessors, (1280), 105 states have call successors, (105), 20 states have call predecessors, (105), 20 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:48:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1490 transitions. [2025-02-06 03:48:32,829 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1490 transitions. Word has length 177 [2025-02-06 03:48:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:32,829 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1490 transitions. [2025-02-06 03:48:32,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1490 transitions. [2025-02-06 03:48:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 03:48:32,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:32,830 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:32,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:48:32,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:32,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1906802384, now seen corresponding path program 1 times [2025-02-06 03:48:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:32,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726765249] [2025-02-06 03:48:32,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:32,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 03:48:32,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 03:48:32,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:32,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726765249] [2025-02-06 03:48:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726765249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372581665] [2025-02-06 03:48:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:33,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:48:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:33,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:48:33,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:48:33,669 INFO L87 Difference]: Start difference. First operand 1161 states and 1490 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:33,965 INFO L93 Difference]: Finished difference Result 2334 states and 3026 transitions. [2025-02-06 03:48:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:48:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2025-02-06 03:48:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:33,970 INFO L225 Difference]: With dead ends: 2334 [2025-02-06 03:48:33,970 INFO L226 Difference]: Without dead ends: 1400 [2025-02-06 03:48:33,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:33,972 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 218 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:33,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 433 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:48:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-02-06 03:48:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1149. [2025-02-06 03:48:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1023 states have (on average 1.227761485826002) internal successors, (1256), 1031 states have internal predecessors, (1256), 105 states have call successors, (105), 20 states have call predecessors, (105), 20 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:48:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1466 transitions. [2025-02-06 03:48:34,017 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1466 transitions. Word has length 177 [2025-02-06 03:48:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:34,018 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1466 transitions. [2025-02-06 03:48:34,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:48:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1466 transitions. [2025-02-06 03:48:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 03:48:34,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:34,019 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:48:34,019 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:34,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1353359485, now seen corresponding path program 1 times [2025-02-06 03:48:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767295896] [2025-02-06 03:48:34,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:34,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:48:34,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:48:34,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:34,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 03:48:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:48:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767295896] [2025-02-06 03:48:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767295896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:48:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148118618] [2025-02-06 03:48:34,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:34,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:48:34,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:48:34,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:48:35,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:48:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:35,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:48:35,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:35,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:48:35,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:48:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:48:35,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:48:35,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:48:35,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:48:35,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 103 [2025-02-06 03:48:35,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:35,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 125 [2025-02-06 03:48:35,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2025-02-06 03:48:35,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:35,360 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 163 treesize of output 118 [2025-02-06 03:48:35,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:35,511 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 220 treesize of output 153 [2025-02-06 03:48:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 03:48:35,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:48:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 03:48:35,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148118618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:48:35,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:48:35,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2025-02-06 03:48:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851515801] [2025-02-06 03:48:35,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:48:35,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:48:35,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:48:35,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:48:35,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:48:35,840 INFO L87 Difference]: Start difference. First operand 1149 states and 1466 transitions. Second operand has 16 states, 13 states have (on average 7.615384615384615) internal successors, (99), 16 states have internal predecessors, (99), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 5 states have call successors, (33) [2025-02-06 03:48:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:38,065 INFO L93 Difference]: Finished difference Result 2595 states and 3315 transitions. [2025-02-06 03:48:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 03:48:38,065 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 7.615384615384615) internal successors, (99), 16 states have internal predecessors, (99), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 5 states have call successors, (33) Word has length 178 [2025-02-06 03:48:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:38,078 INFO L225 Difference]: With dead ends: 2595 [2025-02-06 03:48:38,078 INFO L226 Difference]: Without dead ends: 1659 [2025-02-06 03:48:38,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 351 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=469, Invalid=1787, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 03:48:38,085 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1153 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:38,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 852 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 03:48:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-02-06 03:48:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1187. [2025-02-06 03:48:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1045 states have (on average 1.228708133971292) internal successors, (1284), 1053 states have internal predecessors, (1284), 116 states have call successors, (116), 25 states have call predecessors, (116), 25 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 03:48:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1516 transitions. [2025-02-06 03:48:38,183 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1516 transitions. Word has length 178 [2025-02-06 03:48:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:38,184 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1516 transitions. [2025-02-06 03:48:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 7.615384615384615) internal successors, (99), 16 states have internal predecessors, (99), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 5 states have call successors, (33) [2025-02-06 03:48:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1516 transitions. [2025-02-06 03:48:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-06 03:48:38,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:38,186 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:38,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:48:38,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:48:38,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:38,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1961323395, now seen corresponding path program 1 times [2025-02-06 03:48:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:48:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757639003] [2025-02-06 03:48:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:48:38,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:48:38,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:48:38,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:38,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:48:38,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:48:38,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 03:48:38,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 03:48:38,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:48:38,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:48:38,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:48:38,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:48:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:48:38,664 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:38,737 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:48:38,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:48:38 BoogieIcfgContainer [2025-02-06 03:48:38,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:48:38,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:48:38,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:48:38,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:48:38,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:08" (3/4) ... [2025-02-06 03:48:38,752 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:48:38,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:48:38,753 INFO L158 Benchmark]: Toolchain (without parser) took 31561.85ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.5MB in the beginning and 74.2MB in the end (delta: 49.3MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2025-02-06 03:48:38,753 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:48:38,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.93ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 105.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:48:38,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.79ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 101.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:48:38,754 INFO L158 Benchmark]: Boogie Preprocessor took 37.32ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 98.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:48:38,754 INFO L158 Benchmark]: IcfgBuilder took 697.68ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 61.4MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:48:38,754 INFO L158 Benchmark]: TraceAbstraction took 30564.86ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 60.6MB in the beginning and 74.5MB in the end (delta: -13.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-02-06 03:48:38,754 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 201.3MB. Free memory was 74.5MB in the beginning and 74.2MB in the end (delta: 282.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:48:38,759 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.18ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.93ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 105.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.79ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 101.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.32ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 98.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 697.68ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 61.4MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30564.86ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 60.6MB in the beginning and 74.5MB in the end (delta: -13.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 201.3MB. Free memory was 74.5MB in the beginning and 74.2MB in the end (delta: 282.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 117. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L59] unsigned char last_1_WrapperStruct00_var_1_9 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=0] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L123] EXPR WrapperStruct00.var_1_9 [L123] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_16 [L117] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_16 [L117] 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_9=0] [L117] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L118] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L134] RET updateVariables() [L135] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_9)) [L66] EXPR WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_8 [L66] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8) [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR WrapperStruct00.var_1_14 [L68] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L68] COND TRUE (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15 [L69] EXPR WrapperStruct00.var_1_16 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L69] COND TRUE (WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14 [L70] EXPR WrapperStruct00.var_1_17 [L70] EXPR WrapperStruct00.var_1_7 [L70] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7) [L77] EXPR WrapperStruct00.var_1_5 [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 [L77] EXPR WrapperStruct00.var_1_2 [L77] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L77] ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L77] EXPR WrapperStruct00.var_1_3 [L77] ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L77] COND TRUE ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_10 [L78] WrapperStruct00.var_1_9 = (! WrapperStruct00.var_1_10) [L82] EXPR WrapperStruct00.var_1_9 [L82] unsigned char stepLocal_0 = WrapperStruct00.var_1_9; [L83] stepLocal_0 && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L83] COND FALSE !(stepLocal_0 && WrapperStruct00.var_1_9) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR WrapperStruct00.var_1_9 [L126] EXPR WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))) [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_7 [L126] EXPR WrapperStruct00.var_1_8 [L126] EXPR last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10))))) [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 [L126] EXPR WrapperStruct00.var_1_2 [L126] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))) [L126] EXPR WrapperStruct00.var_1_9 [L126] EXPR WrapperStruct00.var_1_10 [L126] EXPR (((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) [L126] EXPR WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_14 [L126] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8)) [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_8 [L126] EXPR ((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126-L127] return ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4886 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4849 mSDsluCounter, 11600 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8638 mSDsCounter, 1142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8834 IncrementalHoareTripleChecker+Invalid, 9976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1142 mSolverCounterUnsat, 2962 mSDtfsCounter, 8834 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1216 GetRequests, 1027 SyntacticMatches, 12 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1324occurred in iteration=15, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 2130 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 3823 NumberOfCodeBlocks, 3823 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3970 ConstructedInterpolants, 0 QuantifiedInterpolants, 17689 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1826 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 19100/19320 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-02-06 03:48:38,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:48:40,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:48:40,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:48:40,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:48:40,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:48:40,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:48:40,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:48:40,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:48:40,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:48:40,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:48:40,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:48:40,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:48:40,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:48:40,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:48:40,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:48:40,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:40,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:48:40,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:48:40,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:48:40,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:48:40,926 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-jdk21/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 -> 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d [2025-02-06 03:48:41,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:48:41,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:48:41,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:48:41,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:48:41,135 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:48:41,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2025-02-06 03:48:42,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ab9eac46/54a81449c10347bcbe9a4b5a7ff5822b/FLAG19a3ef2c7 [2025-02-06 03:48:42,597 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:48:42,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2025-02-06 03:48:42,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ab9eac46/54a81449c10347bcbe9a4b5a7ff5822b/FLAG19a3ef2c7 [2025-02-06 03:48:42,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ab9eac46/54a81449c10347bcbe9a4b5a7ff5822b [2025-02-06 03:48:42,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:48:42,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:48:42,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:42,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:48:42,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:48:42,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:42" (1/1) ... [2025-02-06 03:48:42,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d2e37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:42, skipping insertion in model container [2025-02-06 03:48:42,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:48:42" (1/1) ... [2025-02-06 03:48:43,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:48:43,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i[916,929] [2025-02-06 03:48:43,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:43,164 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:48:43,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i[916,929] [2025-02-06 03:48:43,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:48:43,234 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:48:43,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43 WrapperNode [2025-02-06 03:48:43,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:48:43,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:43,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:48:43,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:48:43,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,280 INFO L138 Inliner]: procedures = 40, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2025-02-06 03:48:43,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:48:43,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:48:43,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:48:43,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:48:43,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,302 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 37 writes are split as follows [0, 37]. [2025-02-06 03:48:43,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:48:43,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:48:43,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:48:43,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:48:43,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (1/1) ... [2025-02-06 03:48:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:48:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:48:43,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:48:43,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:48:43,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:48:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:48:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:48:43,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:48:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:48:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:48:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:48:43,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:48:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:48:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:48:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:48:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:48:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:48:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:48:43,517 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:48:43,518 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:48:47,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite160#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite157#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem156#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite145#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite155#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-02-06 03:48:47,122 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-02-06 03:48:47,123 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:48:47,130 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:48:47,130 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:48:47,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:47 BoogieIcfgContainer [2025-02-06 03:48:47,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:48:47,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:48:47,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:48:47,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:48:47,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:48:42" (1/3) ... [2025-02-06 03:48:47,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e524a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:47, skipping insertion in model container [2025-02-06 03:48:47,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:48:43" (2/3) ... [2025-02-06 03:48:47,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e524a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:48:47, skipping insertion in model container [2025-02-06 03:48:47,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:48:47" (3/3) ... [2025-02-06 03:48:47,136 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-14.i [2025-02-06 03:48:47,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:48:47,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-14.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:48:47,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:48:47,186 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;@5497a90f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:48:47,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:48:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:48:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:47,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:47,198 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:47,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash -235656688, now seen corresponding path program 1 times [2025-02-06 03:48:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375826436] [2025-02-06 03:48:47,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:47,211 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-02-06 03:48:47,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:47,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 03:48:47,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:48:47,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:47,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:47,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:47,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:47,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:48:47,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-02-06 03:48:47,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:47,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375826436] [2025-02-06 03:48:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375826436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:47,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:47,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:48:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130145673] [2025-02-06 03:48:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:48:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:47,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:48:47,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:48:47,631 INFO L87 Difference]: Start difference. First operand has 127 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:47,649 INFO L93 Difference]: Finished difference Result 248 states and 392 transitions. [2025-02-06 03:48:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:48:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-02-06 03:48:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:47,654 INFO L225 Difference]: With dead ends: 248 [2025-02-06 03:48:47,654 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:48:47,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-02-06 03:48:47,658 INFO L435 NwaCegarLoop]: 183 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, 183 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-02-06 03:48:47,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:48:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:48:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 03:48:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:48:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-02-06 03:48:47,683 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2025-02-06 03:48:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-02-06 03:48:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-02-06 03:48:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 03:48:47,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:47,686 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:47,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:48:47,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 03:48:47,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:47,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:47,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1118315937, now seen corresponding path program 1 times [2025-02-06 03:48:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049705952] [2025-02-06 03:48:47,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:47,889 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-02-06 03:48:47,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:47,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 03:48:47,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:48:47,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 03:48:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 03:48:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:48,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:48:48,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:48,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:48:48,589 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 173 treesize of output 65 [2025-02-06 03:48:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-02-06 03:48:48,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:48,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049705952] [2025-02-06 03:48:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049705952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:48,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:48:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68453684] [2025-02-06 03:48:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:48,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:48:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:48,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:48:48,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:48:48,620 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:51,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:48:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:48:55,460 INFO L93 Difference]: Finished difference Result 246 states and 364 transitions. [2025-02-06 03:48:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:48:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-02-06 03:48:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:48:55,463 INFO L225 Difference]: With dead ends: 246 [2025-02-06 03:48:55,463 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 03:48:55,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 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-02-06 03:48:55,464 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 111 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:48:55,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 517 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-02-06 03:48:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 03:48:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 03:48:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:48:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2025-02-06 03:48:55,472 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 168 [2025-02-06 03:48:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:48:55,473 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2025-02-06 03:48:55,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 03:48:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2025-02-06 03:48:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 03:48:55,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:48:55,475 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:48:55,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:48:55,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 03:48:55,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:48:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:48:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1282681757, now seen corresponding path program 1 times [2025-02-06 03:48:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:48:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562878344] [2025-02-06 03:48:55,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:48:55,681 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-02-06 03:48:55,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:48:55,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 03:48:55,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:48:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 03:48:56,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 03:48:56,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:48:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:48:56,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:48:56,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:48:56,147 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 99 treesize of output 98 [2025-02-06 03:48:56,368 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 151 treesize of output 133 [2025-02-06 03:48:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:48:56,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:48:56,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:48:56,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562878344] [2025-02-06 03:48:56,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562878344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:48:56,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:48:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:48:56,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800370984] [2025-02-06 03:48:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:48:56,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:48:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:48:56,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:48:56,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:48:56,813 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:49:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:02,037 INFO L93 Difference]: Finished difference Result 367 states and 541 transitions. [2025-02-06 03:49:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:49:02,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2025-02-06 03:49:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:02,040 INFO L225 Difference]: With dead ends: 367 [2025-02-06 03:49:02,040 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 03:49:02,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:02,046 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 97 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:02,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 451 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 03:49:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 03:49:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 218. [2025-02-06 03:49:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.369942196531792) internal successors, (237), 173 states have internal predecessors, (237), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:49:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 321 transitions. [2025-02-06 03:49:02,063 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 321 transitions. Word has length 170 [2025-02-06 03:49:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:02,063 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 321 transitions. [2025-02-06 03:49:02,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 03:49:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2025-02-06 03:49:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 03:49:02,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:02,065 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:02,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:49:02,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-06 03:49:02,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1349688510, now seen corresponding path program 1 times [2025-02-06 03:49:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628006701] [2025-02-06 03:49:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:02,271 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-02-06 03:49:02,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:02,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-06 03:49:02,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:49:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 03:49:02,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 03:49:02,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:02,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:02,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:49:02,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:02,697 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-02-06 03:49:02,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:49:03,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:03,161 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 52 treesize of output 33 [2025-02-06 03:49:03,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:03,306 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 52 treesize of output 33 [2025-02-06 03:49:03,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:03,528 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 52 treesize of output 33 [2025-02-06 03:49:03,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:03,648 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 63 treesize of output 33 [2025-02-06 03:49:03,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:03,768 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 52 treesize of output 33 [2025-02-06 03:49:03,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:03,920 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 68 treesize of output 70 [2025-02-06 03:49:04,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:04,032 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 85 treesize of output 84 [2025-02-06 03:49:04,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 107 [2025-02-06 03:49:04,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:49:04,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:04,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 167 [2025-02-06 03:49:04,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:49:04,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 118 treesize of output 52 [2025-02-06 03:49:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 452 proven. 54 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-06 03:49:04,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:49:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 54 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-02-06 03:49:05,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:05,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628006701] [2025-02-06 03:49:05,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628006701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:49:05,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:49:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 20 [2025-02-06 03:49:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592152638] [2025-02-06 03:49:05,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:49:05,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:49:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:05,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:49:05,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:49:05,209 INFO L87 Difference]: Start difference. First operand 218 states and 321 transitions. Second operand has 20 states, 16 states have (on average 7.25) internal successors, (116), 19 states have internal predecessors, (116), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-06 03:49:15,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:49:18,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:49:28,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]