./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-p_file-71.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 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:50:05,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:50:05,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:50:05,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:50:05,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:50:05,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:50:05,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:50:05,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:50:05,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:50:05,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:50:05,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:50:05,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:50:05,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:50:05,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:50:05,418 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:50:05,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:50:05,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:50:05,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:50:05,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:50:05,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:50:05,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:50:05,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:50:05,421 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 -> 660f06fd7b788e8c10cf619684bc86bfa7277339b3513d64ca91be95bd68ab85 [2025-01-09 15:50:05,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:50:05,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:50:05,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:50:05,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:50:05,695 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:50:05,697 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-p_file-71.i [2025-01-09 15:50:06,900 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af8db831c/b90a856eb81c471faf032b4f9566c5cc/FLAG51117f49e [2025-01-09 15:50:07,141 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:50:07,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-71.i [2025-01-09 15:50:07,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af8db831c/b90a856eb81c471faf032b4f9566c5cc/FLAG51117f49e [2025-01-09 15:50:07,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af8db831c/b90a856eb81c471faf032b4f9566c5cc [2025-01-09 15:50:07,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:50:07,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:50:07,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:50:07,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:50:07,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:50:07,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230811b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07, skipping insertion in model container [2025-01-09 15:50:07,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:50:07,296 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-p_file-71.i[916,929] [2025-01-09 15:50:07,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:50:07,356 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:50:07,365 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-p_file-71.i[916,929] [2025-01-09 15:50:07,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:50:07,415 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:50:07,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07 WrapperNode [2025-01-09 15:50:07,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:50:07,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:50:07,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:50:07,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:50:07,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,461 INFO L138 Inliner]: procedures = 26, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-01-09 15:50:07,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:50:07,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:50:07,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:50:07,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:50:07,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,499 INFO L175 MemorySlicer]: Split 138 memory accesses to 15 slices as follows [2, 11, 6, 22, 22, 22, 6, 8, 5, 3, 8, 7, 3, 6, 7]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:50:07,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:50:07,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:50:07,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:50:07,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:50:07,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (1/1) ... [2025-01-09 15:50:07,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:50:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:50:07,557 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-01-09 15:50:07,560 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-01-09 15:50:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:50:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:50:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:50:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:50:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:50:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:50:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 15:50:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:50:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:50:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:50:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 15:50:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:50:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:50:07,724 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:50:07,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:50:08,122 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:50:08,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:50:08,130 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:50:08,131 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:50:08,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:08 BoogieIcfgContainer [2025-01-09 15:50:08,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:50:08,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:50:08,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:50:08,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:50:08,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:50:07" (1/3) ... [2025-01-09 15:50:08,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a3932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:08, skipping insertion in model container [2025-01-09 15:50:08,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:07" (2/3) ... [2025-01-09 15:50:08,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a3932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:08, skipping insertion in model container [2025-01-09 15:50:08,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:08" (3/3) ... [2025-01-09 15:50:08,139 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-71.i [2025-01-09 15:50:08,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:50:08,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-71.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:50:08,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:50:08,210 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;@1c75e369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:50:08,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:50:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:50:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:50:08,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:08,225 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:08,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1545980022, now seen corresponding path program 1 times [2025-01-09 15:50:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:08,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088139039] [2025-01-09 15:50:08,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:08,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:50:08,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:50:08,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:08,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:50:08,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088139039] [2025-01-09 15:50:08,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088139039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:08,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948237270] [2025-01-09 15:50:08,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:50:08,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:50:08,528 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-01-09 15:50:08,530 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-01-09 15:50:08,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:50:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:50:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:08,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:50:08,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:50:08,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948237270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:08,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:50:08,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:50:08,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478003101] [2025-01-09 15:50:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:50:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:08,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:50:08,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:50:08,799 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:50:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:08,818 INFO L93 Difference]: Finished difference Result 202 states and 316 transitions. [2025-01-09 15:50:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:50:08,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2025-01-09 15:50:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:08,827 INFO L225 Difference]: With dead ends: 202 [2025-01-09 15:50:08,828 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:50:08,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-01-09 15:50:08,834 INFO L435 NwaCegarLoop]: 144 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, 144 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-01-09 15:50:08,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:50:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 15:50:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:50:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-01-09 15:50:08,866 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2025-01-09 15:50:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:08,866 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-01-09 15:50:08,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:50:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-01-09 15:50:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:50:08,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:08,869 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:08,876 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-01-09 15:50:09,069 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-01-09 15:50:09,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1743471844, now seen corresponding path program 1 times [2025-01-09 15:50:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927913025] [2025-01-09 15:50:09,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:09,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:50:09,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:50:09,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:09,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927913025] [2025-01-09 15:50:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927913025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:50:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209054543] [2025-01-09 15:50:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:50:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:09,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:50:09,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:50:09,263 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:09,291 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-01-09 15:50:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:50:09,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:50:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:09,293 INFO L225 Difference]: With dead ends: 200 [2025-01-09 15:50:09,293 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 15:50:09,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:50:09,294 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:09,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 15:50:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 15:50:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:50:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2025-01-09 15:50:09,307 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 144 [2025-01-09 15:50:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:09,308 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2025-01-09 15:50:09,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2025-01-09 15:50:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:50:09,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:09,309 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:09,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:50:09,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:09,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash -463608166, now seen corresponding path program 1 times [2025-01-09 15:50:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585323974] [2025-01-09 15:50:09,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:50:09,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:50:09,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:09,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:09,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585323974] [2025-01-09 15:50:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585323974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:09,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:50:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168548955] [2025-01-09 15:50:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:09,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:50:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:09,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:50:09,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:50:09,542 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:09,577 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2025-01-09 15:50:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:50:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:50:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:09,579 INFO L225 Difference]: With dead ends: 204 [2025-01-09 15:50:09,579 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 15:50:09,579 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-01-09 15:50:09,579 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:09,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 15:50:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-01-09 15:50:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:50:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2025-01-09 15:50:09,586 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 144 [2025-01-09 15:50:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:09,587 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2025-01-09 15:50:09,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2025-01-09 15:50:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:50:09,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:09,588 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:09,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:50:09,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:09,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1311399196, now seen corresponding path program 1 times [2025-01-09 15:50:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853445625] [2025-01-09 15:50:09,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:09,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:50:09,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:50:09,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:09,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:09,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853445625] [2025-01-09 15:50:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853445625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:50:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781401961] [2025-01-09 15:50:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:50:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:09,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:50:09,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:50:09,731 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:09,751 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2025-01-09 15:50:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:50:09,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:50:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:09,753 INFO L225 Difference]: With dead ends: 208 [2025-01-09 15:50:09,753 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 15:50:09,755 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-01-09 15:50:09,756 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:09,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 15:50:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 15:50:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:50:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2025-01-09 15:50:09,768 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 144 [2025-01-09 15:50:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:09,769 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2025-01-09 15:50:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2025-01-09 15:50:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:50:09,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:09,774 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:09,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:50:09,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:09,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:09,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1313246238, now seen corresponding path program 1 times [2025-01-09 15:50:09,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:09,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001508358] [2025-01-09 15:50:09,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:09,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:09,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:50:09,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:50:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:10,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001508358] [2025-01-09 15:50:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001508358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:10,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:10,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712092282] [2025-01-09 15:50:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:10,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:10,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:10,164 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:10,282 INFO L93 Difference]: Finished difference Result 293 states and 411 transitions. [2025-01-09 15:50:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2025-01-09 15:50:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:10,284 INFO L225 Difference]: With dead ends: 293 [2025-01-09 15:50:10,284 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 15:50:10,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:10,285 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 120 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:10,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 709 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 15:50:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2025-01-09 15:50:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 147 states have internal predecessors, (191), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:50:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2025-01-09 15:50:10,301 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 144 [2025-01-09 15:50:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:10,301 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2025-01-09 15:50:10,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2025-01-09 15:50:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:50:10,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:10,304 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:10,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:50:10,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:10,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1496792562, now seen corresponding path program 1 times [2025-01-09 15:50:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:10,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626824692] [2025-01-09 15:50:10,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:10,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:50:10,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:50:10,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626824692] [2025-01-09 15:50:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626824692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:50:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206055997] [2025-01-09 15:50:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:10,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:50:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:10,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:50:10,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:10,934 INFO L87 Difference]: Start difference. First operand 178 states and 249 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:11,081 INFO L93 Difference]: Finished difference Result 446 states and 621 transitions. [2025-01-09 15:50:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2025-01-09 15:50:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:11,084 INFO L225 Difference]: With dead ends: 446 [2025-01-09 15:50:11,084 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 15:50:11,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:11,088 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 109 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:11,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 808 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 15:50:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 266. [2025-01-09 15:50:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 219 states have internal predecessors, (280), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 15:50:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 370 transitions. [2025-01-09 15:50:11,112 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 370 transitions. Word has length 145 [2025-01-09 15:50:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:11,112 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 370 transitions. [2025-01-09 15:50:11,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 370 transitions. [2025-01-09 15:50:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:50:11,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:11,113 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:11,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:50:11,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:11,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1887889559, now seen corresponding path program 1 times [2025-01-09 15:50:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:11,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783536966] [2025-01-09 15:50:11,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:11,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:50:11,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:50:11,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:11,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:12,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783536966] [2025-01-09 15:50:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783536966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:12,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:50:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218924464] [2025-01-09 15:50:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:50:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:12,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:50:12,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:50:12,163 INFO L87 Difference]: Start difference. First operand 266 states and 370 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:13,126 INFO L93 Difference]: Finished difference Result 580 states and 802 transitions. [2025-01-09 15:50:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:50:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2025-01-09 15:50:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:13,128 INFO L225 Difference]: With dead ends: 580 [2025-01-09 15:50:13,129 INFO L226 Difference]: Without dead ends: 338 [2025-01-09 15:50:13,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:50:13,131 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 413 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:13,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1292 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:50:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-09 15:50:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 273. [2025-01-09 15:50:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 225 states have internal predecessors, (286), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 15:50:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 376 transitions. [2025-01-09 15:50:13,159 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 376 transitions. Word has length 146 [2025-01-09 15:50:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:13,159 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 376 transitions. [2025-01-09 15:50:13,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2025-01-09 15:50:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:50:13,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:13,161 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:50:13,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:13,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 636186974, now seen corresponding path program 1 times [2025-01-09 15:50:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:13,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291783129] [2025-01-09 15:50:13,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:13,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:50:13,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:50:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291783129] [2025-01-09 15:50:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291783129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:13,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:13,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430066651] [2025-01-09 15:50:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:13,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:13,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:13,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:13,352 INFO L87 Difference]: Start difference. First operand 273 states and 376 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:13,400 INFO L93 Difference]: Finished difference Result 512 states and 704 transitions. [2025-01-09 15:50:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:13,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2025-01-09 15:50:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:13,402 INFO L225 Difference]: With dead ends: 512 [2025-01-09 15:50:13,402 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 15:50:13,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:13,403 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:13,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 542 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 15:50:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-01-09 15:50:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 213 states have internal predecessors, (266), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 15:50:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 356 transitions. [2025-01-09 15:50:13,420 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 356 transitions. Word has length 146 [2025-01-09 15:50:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:13,420 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 356 transitions. [2025-01-09 15:50:13,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 356 transitions. [2025-01-09 15:50:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:50:13,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:13,421 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:13,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:50:13,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:13,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -875757078, now seen corresponding path program 1 times [2025-01-09 15:50:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458153574] [2025-01-09 15:50:13,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:13,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:50:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:50:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458153574] [2025-01-09 15:50:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458153574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:13,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:13,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229767042] [2025-01-09 15:50:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:13,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:13,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:13,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:13,973 INFO L87 Difference]: Start difference. First operand 261 states and 356 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:14,246 INFO L93 Difference]: Finished difference Result 558 states and 759 transitions. [2025-01-09 15:50:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:14,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2025-01-09 15:50:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:14,248 INFO L225 Difference]: With dead ends: 558 [2025-01-09 15:50:14,248 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 15:50:14,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:14,249 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 227 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:14,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 870 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 15:50:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2025-01-09 15:50:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 262 states have (on average 1.2709923664122138) internal successors, (333), 266 states have internal predecessors, (333), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 15:50:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 431 transitions. [2025-01-09 15:50:14,269 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 431 transitions. Word has length 147 [2025-01-09 15:50:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 431 transitions. [2025-01-09 15:50:14,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 431 transitions. [2025-01-09 15:50:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:50:14,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:14,271 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:14,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:50:14,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:14,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2139346540, now seen corresponding path program 1 times [2025-01-09 15:50:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:14,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220922687] [2025-01-09 15:50:14,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:14,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:50:14,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:50:14,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:14,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220922687] [2025-01-09 15:50:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220922687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:14,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435097075] [2025-01-09 15:50:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:14,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:14,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:14,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:14,690 INFO L87 Difference]: Start difference. First operand 318 states and 431 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:14,975 INFO L93 Difference]: Finished difference Result 663 states and 889 transitions. [2025-01-09 15:50:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:50:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-01-09 15:50:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:14,977 INFO L225 Difference]: With dead ends: 663 [2025-01-09 15:50:14,977 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 15:50:14,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:14,978 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 127 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:14,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 757 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 15:50:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 322. [2025-01-09 15:50:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 264 states have (on average 1.2613636363636365) internal successors, (333), 268 states have internal predecessors, (333), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 15:50:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2025-01-09 15:50:15,000 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 147 [2025-01-09 15:50:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:15,000 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2025-01-09 15:50:15,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2025-01-09 15:50:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:50:15,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:15,002 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:15,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:50:15,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:15,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -735208468, now seen corresponding path program 1 times [2025-01-09 15:50:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107749085] [2025-01-09 15:50:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:15,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:50:15,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:50:15,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:15,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107749085] [2025-01-09 15:50:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107749085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:50:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107026036] [2025-01-09 15:50:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:15,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:50:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:15,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:50:15,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:15,777 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 15:50:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:16,654 INFO L93 Difference]: Finished difference Result 667 states and 889 transitions. [2025-01-09 15:50:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:50:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 147 [2025-01-09 15:50:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:16,657 INFO L225 Difference]: With dead ends: 667 [2025-01-09 15:50:16,657 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 15:50:16,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:50:16,658 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 504 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:16,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 784 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:50:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 15:50:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 326. [2025-01-09 15:50:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 267 states have (on average 1.2546816479400749) internal successors, (335), 271 states have internal predecessors, (335), 49 states have call successors, (49), 9 states have call predecessors, (49), 9 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 15:50:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2025-01-09 15:50:16,681 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 147 [2025-01-09 15:50:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:16,682 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2025-01-09 15:50:16,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 15:50:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2025-01-09 15:50:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:50:16,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:16,683 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:16,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:50:16,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:16,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2015072146, now seen corresponding path program 1 times [2025-01-09 15:50:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:16,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708997030] [2025-01-09 15:50:16,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:16,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:50:16,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:50:16,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:16,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:16,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:16,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708997030] [2025-01-09 15:50:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708997030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:16,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:50:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058908865] [2025-01-09 15:50:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:50:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:50:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:16,911 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:17,043 INFO L93 Difference]: Finished difference Result 675 states and 901 transitions. [2025-01-09 15:50:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:17,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-01-09 15:50:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:17,046 INFO L225 Difference]: With dead ends: 675 [2025-01-09 15:50:17,046 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 15:50:17,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:17,047 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 115 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:17,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1394 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 15:50:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 364. [2025-01-09 15:50:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 288 states have (on average 1.2326388888888888) internal successors, (355), 292 states have internal predecessors, (355), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:50:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 483 transitions. [2025-01-09 15:50:17,074 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 483 transitions. Word has length 147 [2025-01-09 15:50:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:17,074 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 483 transitions. [2025-01-09 15:50:17,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 483 transitions. [2025-01-09 15:50:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:50:17,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:17,075 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:50:17,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 803898842, now seen corresponding path program 1 times [2025-01-09 15:50:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715550746] [2025-01-09 15:50:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:50:17,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:50:17,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:17,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715550746] [2025-01-09 15:50:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715550746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782059748] [2025-01-09 15:50:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:17,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:17,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:17,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:17,201 INFO L87 Difference]: Start difference. First operand 364 states and 483 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:17,257 INFO L93 Difference]: Finished difference Result 696 states and 924 transitions. [2025-01-09 15:50:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-01-09 15:50:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:17,260 INFO L225 Difference]: With dead ends: 696 [2025-01-09 15:50:17,260 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 15:50:17,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:17,261 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 55 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:17,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 662 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 15:50:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2025-01-09 15:50:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 282 states have (on average 1.2234042553191489) internal successors, (345), 286 states have internal predecessors, (345), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:50:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 473 transitions. [2025-01-09 15:50:17,295 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 473 transitions. Word has length 147 [2025-01-09 15:50:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:17,295 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 473 transitions. [2025-01-09 15:50:17,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 473 transitions. [2025-01-09 15:50:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:50:17,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:17,297 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:17,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:50:17,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:17,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 513518131, now seen corresponding path program 1 times [2025-01-09 15:50:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389673016] [2025-01-09 15:50:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:17,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:50:17,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:50:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389673016] [2025-01-09 15:50:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389673016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:17,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910090569] [2025-01-09 15:50:17,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:17,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:17,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:17,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:17,461 INFO L87 Difference]: Start difference. First operand 358 states and 473 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:17,548 INFO L93 Difference]: Finished difference Result 694 states and 916 transitions. [2025-01-09 15:50:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:50:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:17,550 INFO L225 Difference]: With dead ends: 694 [2025-01-09 15:50:17,550 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 15:50:17,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:17,551 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 71 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:17,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 648 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 15:50:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-01-09 15:50:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 284 states have (on average 1.2183098591549295) internal successors, (346), 288 states have internal predecessors, (346), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:50:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 474 transitions. [2025-01-09 15:50:17,579 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 474 transitions. Word has length 148 [2025-01-09 15:50:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:17,579 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 474 transitions. [2025-01-09 15:50:17,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 474 transitions. [2025-01-09 15:50:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:50:17,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:17,580 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:17,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:50:17,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:17,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1324237321, now seen corresponding path program 1 times [2025-01-09 15:50:17,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:17,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716498677] [2025-01-09 15:50:17,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:17,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:50:17,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:50:17,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:17,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:17,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716498677] [2025-01-09 15:50:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716498677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148858872] [2025-01-09 15:50:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:17,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:17,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:17,726 INFO L87 Difference]: Start difference. First operand 361 states and 474 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:17,823 INFO L93 Difference]: Finished difference Result 697 states and 916 transitions. [2025-01-09 15:50:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:17,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:50:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:17,825 INFO L225 Difference]: With dead ends: 697 [2025-01-09 15:50:17,825 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 15:50:17,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:17,826 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 95 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:17,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 581 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 15:50:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-01-09 15:50:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 284 states have (on average 1.2147887323943662) internal successors, (345), 288 states have internal predecessors, (345), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:50:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 473 transitions. [2025-01-09 15:50:17,853 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 473 transitions. Word has length 148 [2025-01-09 15:50:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:17,853 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 473 transitions. [2025-01-09 15:50:17,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 473 transitions. [2025-01-09 15:50:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:50:17,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:17,855 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:50:17,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2101866033, now seen corresponding path program 1 times [2025-01-09 15:50:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833549825] [2025-01-09 15:50:17,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:17,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:50:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:50:17,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:17,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833549825] [2025-01-09 15:50:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833549825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426219946] [2025-01-09 15:50:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:17,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:18,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:18,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:18,000 INFO L87 Difference]: Start difference. First operand 361 states and 473 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:18,090 INFO L93 Difference]: Finished difference Result 692 states and 907 transitions. [2025-01-09 15:50:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:50:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:18,093 INFO L225 Difference]: With dead ends: 692 [2025-01-09 15:50:18,093 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 15:50:18,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:18,094 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 94 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:18,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 632 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 15:50:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2025-01-09 15:50:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 279 states have (on average 1.2078853046594982) internal successors, (337), 283 states have internal predecessors, (337), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:50:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 465 transitions. [2025-01-09 15:50:18,123 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 465 transitions. Word has length 148 [2025-01-09 15:50:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:18,123 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 465 transitions. [2025-01-09 15:50:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 465 transitions. [2025-01-09 15:50:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:50:18,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:18,125 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:18,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:50:18,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1056823534, now seen corresponding path program 1 times [2025-01-09 15:50:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791485643] [2025-01-09 15:50:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:18,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:50:18,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:50:18,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:18,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:18,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:18,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791485643] [2025-01-09 15:50:18,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791485643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:18,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:18,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:18,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183383507] [2025-01-09 15:50:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:18,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:18,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:18,467 INFO L87 Difference]: Start difference. First operand 356 states and 465 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:18,713 INFO L93 Difference]: Finished difference Result 749 states and 982 transitions. [2025-01-09 15:50:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-01-09 15:50:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:18,716 INFO L225 Difference]: With dead ends: 749 [2025-01-09 15:50:18,716 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 15:50:18,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:50:18,717 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 81 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:18,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1294 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 15:50:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2025-01-09 15:50:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 334 states have (on average 1.221556886227545) internal successors, (408), 339 states have internal predecessors, (408), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 15:50:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 548 transitions. [2025-01-09 15:50:18,748 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 548 transitions. Word has length 148 [2025-01-09 15:50:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:18,748 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 548 transitions. [2025-01-09 15:50:18,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 548 transitions. [2025-01-09 15:50:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:50:18,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:18,750 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:18,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:50:18,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:18,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -250391908, now seen corresponding path program 1 times [2025-01-09 15:50:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296734328] [2025-01-09 15:50:18,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:18,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:50:18,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:50:18,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:18,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:19,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296734328] [2025-01-09 15:50:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296734328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:19,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:50:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913365666] [2025-01-09 15:50:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:50:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:19,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:50:19,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:19,729 INFO L87 Difference]: Start difference. First operand 418 states and 548 transitions. Second operand has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:20,313 INFO L93 Difference]: Finished difference Result 1011 states and 1326 transitions. [2025-01-09 15:50:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:50:20,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 149 [2025-01-09 15:50:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:20,317 INFO L225 Difference]: With dead ends: 1011 [2025-01-09 15:50:20,318 INFO L226 Difference]: Without dead ends: 621 [2025-01-09 15:50:20,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:50:20,320 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 228 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:20,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 941 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-01-09 15:50:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 553. [2025-01-09 15:50:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 463 states have (on average 1.2462203023758098) internal successors, (577), 470 states have internal predecessors, (577), 74 states have call successors, (74), 15 states have call predecessors, (74), 15 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 15:50:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 725 transitions. [2025-01-09 15:50:20,368 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 725 transitions. Word has length 149 [2025-01-09 15:50:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 725 transitions. [2025-01-09 15:50:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 725 transitions. [2025-01-09 15:50:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:20,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:20,371 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:20,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:50:20,371 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2116819280, now seen corresponding path program 1 times [2025-01-09 15:50:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277015834] [2025-01-09 15:50:20,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:20,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:20,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:20,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:20,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277015834] [2025-01-09 15:50:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277015834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:20,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603936233] [2025-01-09 15:50:20,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:20,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:20,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:20,789 INFO L87 Difference]: Start difference. First operand 553 states and 725 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:21,095 INFO L93 Difference]: Finished difference Result 1207 states and 1575 transitions. [2025-01-09 15:50:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:50:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:21,099 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 15:50:21,099 INFO L226 Difference]: Without dead ends: 682 [2025-01-09 15:50:21,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:21,101 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 74 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:21,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1431 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-09 15:50:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 629. [2025-01-09 15:50:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 519 states have (on average 1.2254335260115607) internal successors, (636), 527 states have internal predecessors, (636), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 80 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 15:50:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 812 transitions. [2025-01-09 15:50:21,144 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 812 transitions. Word has length 150 [2025-01-09 15:50:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:21,144 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 812 transitions. [2025-01-09 15:50:21,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 812 transitions. [2025-01-09 15:50:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:21,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:21,147 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:21,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:50:21,148 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1964726569, now seen corresponding path program 1 times [2025-01-09 15:50:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604018997] [2025-01-09 15:50:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:21,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:21,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:21,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:21,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604018997] [2025-01-09 15:50:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604018997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:21,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:50:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656786382] [2025-01-09 15:50:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:21,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:50:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:21,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:50:21,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:50:21,910 INFO L87 Difference]: Start difference. First operand 629 states and 812 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 15:50:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:22,893 INFO L93 Difference]: Finished difference Result 1451 states and 1873 transitions. [2025-01-09 15:50:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:50:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 150 [2025-01-09 15:50:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:22,897 INFO L225 Difference]: With dead ends: 1451 [2025-01-09 15:50:22,898 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 15:50:22,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:50:22,900 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 503 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:22,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 983 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:50:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 15:50:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 702. [2025-01-09 15:50:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 589 states have (on average 1.2359932088285228) internal successors, (728), 598 states have internal predecessors, (728), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 908 transitions. [2025-01-09 15:50:22,941 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 908 transitions. Word has length 150 [2025-01-09 15:50:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:22,941 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 908 transitions. [2025-01-09 15:50:22,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 17 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 15:50:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 908 transitions. [2025-01-09 15:50:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:22,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:22,943 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:22,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:50:22,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 336096021, now seen corresponding path program 1 times [2025-01-09 15:50:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748379104] [2025-01-09 15:50:22,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:22,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:23,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:23,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:23,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:23,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748379104] [2025-01-09 15:50:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748379104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219381319] [2025-01-09 15:50:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:23,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:23,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:23,354 INFO L87 Difference]: Start difference. First operand 702 states and 908 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:23,754 INFO L93 Difference]: Finished difference Result 1560 states and 2014 transitions. [2025-01-09 15:50:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-01-09 15:50:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:23,759 INFO L225 Difference]: With dead ends: 1560 [2025-01-09 15:50:23,759 INFO L226 Difference]: Without dead ends: 886 [2025-01-09 15:50:23,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:23,761 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 198 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:23,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 700 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-09 15:50:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 713. [2025-01-09 15:50:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 600 states have (on average 1.2383333333333333) internal successors, (743), 609 states have internal predecessors, (743), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 923 transitions. [2025-01-09 15:50:23,800 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 923 transitions. Word has length 150 [2025-01-09 15:50:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:23,801 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 923 transitions. [2025-01-09 15:50:23,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 923 transitions. [2025-01-09 15:50:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:23,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:23,802 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:23,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:50:23,802 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash -943767657, now seen corresponding path program 1 times [2025-01-09 15:50:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127344661] [2025-01-09 15:50:23,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:23,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:23,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:23,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127344661] [2025-01-09 15:50:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127344661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:23,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918859389] [2025-01-09 15:50:23,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:23,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:23,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:23,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:23,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:23,981 INFO L87 Difference]: Start difference. First operand 713 states and 923 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:24,139 INFO L93 Difference]: Finished difference Result 1600 states and 2072 transitions. [2025-01-09 15:50:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:50:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:24,145 INFO L225 Difference]: With dead ends: 1600 [2025-01-09 15:50:24,145 INFO L226 Difference]: Without dead ends: 915 [2025-01-09 15:50:24,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:24,147 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 61 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:24,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 565 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-09 15:50:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 741. [2025-01-09 15:50:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 628 states have (on average 1.2404458598726114) internal successors, (779), 637 states have internal predecessors, (779), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 959 transitions. [2025-01-09 15:50:24,187 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 959 transitions. Word has length 150 [2025-01-09 15:50:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:24,189 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 959 transitions. [2025-01-09 15:50:24,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 959 transitions. [2025-01-09 15:50:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:24,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:24,190 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:24,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:50:24,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:24,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1745871851, now seen corresponding path program 1 times [2025-01-09 15:50:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118921597] [2025-01-09 15:50:24,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:24,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:24,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:24,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:24,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118921597] [2025-01-09 15:50:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118921597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:50:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457419163] [2025-01-09 15:50:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:50:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:25,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:50:25,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:25,128 INFO L87 Difference]: Start difference. First operand 741 states and 959 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:26,111 INFO L93 Difference]: Finished difference Result 1536 states and 1984 transitions. [2025-01-09 15:50:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:50:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-01-09 15:50:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:26,116 INFO L225 Difference]: With dead ends: 1536 [2025-01-09 15:50:26,117 INFO L226 Difference]: Without dead ends: 823 [2025-01-09 15:50:26,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:50:26,119 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 254 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:26,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 886 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:50:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-01-09 15:50:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 731. [2025-01-09 15:50:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 618 states have (on average 1.2394822006472492) internal successors, (766), 627 states have internal predecessors, (766), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 946 transitions. [2025-01-09 15:50:26,158 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 946 transitions. Word has length 150 [2025-01-09 15:50:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 946 transitions. [2025-01-09 15:50:26,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 946 transitions. [2025-01-09 15:50:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:26,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:26,161 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:50:26,161 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1045400909, now seen corresponding path program 1 times [2025-01-09 15:50:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132788261] [2025-01-09 15:50:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:26,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:26,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:26,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:26,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132788261] [2025-01-09 15:50:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132788261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:26,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:50:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857996134] [2025-01-09 15:50:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:26,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:50:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:26,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:50:26,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:50:26,631 INFO L87 Difference]: Start difference. First operand 731 states and 946 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:27,301 INFO L93 Difference]: Finished difference Result 1615 states and 2085 transitions. [2025-01-09 15:50:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:50:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-01-09 15:50:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:27,307 INFO L225 Difference]: With dead ends: 1615 [2025-01-09 15:50:27,307 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 15:50:27,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:50:27,309 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 284 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:27,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1035 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 15:50:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 733. [2025-01-09 15:50:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 620 states have (on average 1.2370967741935484) internal successors, (767), 629 states have internal predecessors, (767), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 947 transitions. [2025-01-09 15:50:27,349 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 947 transitions. Word has length 150 [2025-01-09 15:50:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:27,350 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 947 transitions. [2025-01-09 15:50:27,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 947 transitions. [2025-01-09 15:50:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:27,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:27,351 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:27,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:50:27,352 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:27,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -578523175, now seen corresponding path program 1 times [2025-01-09 15:50:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532589913] [2025-01-09 15:50:27,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:27,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:27,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:27,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:27,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532589913] [2025-01-09 15:50:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532589913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:50:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671159080] [2025-01-09 15:50:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:27,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:50:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:27,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:50:27,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:27,932 INFO L87 Difference]: Start difference. First operand 733 states and 947 transitions. Second operand has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:28,563 INFO L93 Difference]: Finished difference Result 1515 states and 1954 transitions. [2025-01-09 15:50:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:50:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 150 [2025-01-09 15:50:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:28,567 INFO L225 Difference]: With dead ends: 1515 [2025-01-09 15:50:28,567 INFO L226 Difference]: Without dead ends: 810 [2025-01-09 15:50:28,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:50:28,569 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 219 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:28,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 847 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-01-09 15:50:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 725. [2025-01-09 15:50:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 612 states have (on average 1.2352941176470589) internal successors, (756), 621 states have internal predecessors, (756), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 936 transitions. [2025-01-09 15:50:28,617 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 936 transitions. Word has length 150 [2025-01-09 15:50:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 936 transitions. [2025-01-09 15:50:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 936 transitions. [2025-01-09 15:50:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:28,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:28,619 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:28,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:50:28,619 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash 442435737, now seen corresponding path program 1 times [2025-01-09 15:50:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416477406] [2025-01-09 15:50:28,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:28,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416477406] [2025-01-09 15:50:28,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416477406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:28,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:28,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:50:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592818715] [2025-01-09 15:50:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:28,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:50:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:28,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:50:28,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:28,765 INFO L87 Difference]: Start difference. First operand 725 states and 936 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:28,932 INFO L93 Difference]: Finished difference Result 1524 states and 1962 transitions. [2025-01-09 15:50:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:28,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:50:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:28,936 INFO L225 Difference]: With dead ends: 1524 [2025-01-09 15:50:28,936 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 15:50:28,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:28,937 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 65 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:28,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 885 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 15:50:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 724. [2025-01-09 15:50:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 611 states have (on average 1.23240589198036) internal successors, (753), 620 states have internal predecessors, (753), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 933 transitions. [2025-01-09 15:50:28,979 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 933 transitions. Word has length 150 [2025-01-09 15:50:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:28,979 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 933 transitions. [2025-01-09 15:50:28,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 933 transitions. [2025-01-09 15:50:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:28,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:28,981 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:28,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:50:28,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:28,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1863362993, now seen corresponding path program 1 times [2025-01-09 15:50:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:28,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880348919] [2025-01-09 15:50:28,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:28,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:29,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:29,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:29,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:29,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:29,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880348919] [2025-01-09 15:50:29,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880348919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:29,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:29,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:50:29,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980305592] [2025-01-09 15:50:29,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:29,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:50:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:29,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:50:29,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:29,781 INFO L87 Difference]: Start difference. First operand 724 states and 933 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:30,998 INFO L93 Difference]: Finished difference Result 1714 states and 2209 transitions. [2025-01-09 15:50:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:50:30,999 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 150 [2025-01-09 15:50:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:31,003 INFO L225 Difference]: With dead ends: 1714 [2025-01-09 15:50:31,004 INFO L226 Difference]: Without dead ends: 1018 [2025-01-09 15:50:31,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:50:31,007 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 434 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:31,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1242 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:50:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-01-09 15:50:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 749. [2025-01-09 15:50:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 636 states have (on average 1.240566037735849) internal successors, (789), 645 states have internal predecessors, (789), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 81 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:50:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 969 transitions. [2025-01-09 15:50:31,054 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 969 transitions. Word has length 150 [2025-01-09 15:50:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:31,054 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 969 transitions. [2025-01-09 15:50:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 969 transitions. [2025-01-09 15:50:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:31,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:31,055 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:31,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:50:31,056 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:31,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1410535949, now seen corresponding path program 1 times [2025-01-09 15:50:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184955718] [2025-01-09 15:50:31,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:31,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:31,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:31,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:31,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184955718] [2025-01-09 15:50:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184955718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:31,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:31,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429644792] [2025-01-09 15:50:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:31,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:31,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:31,290 INFO L87 Difference]: Start difference. First operand 749 states and 969 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:31,645 INFO L93 Difference]: Finished difference Result 1585 states and 2045 transitions. [2025-01-09 15:50:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:31,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-01-09 15:50:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:31,649 INFO L225 Difference]: With dead ends: 1585 [2025-01-09 15:50:31,650 INFO L226 Difference]: Without dead ends: 864 [2025-01-09 15:50:31,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:31,651 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 314 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:31,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 898 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-01-09 15:50:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 754. [2025-01-09 15:50:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 643 states have (on average 1.2410575427682737) internal successors, (798), 652 states have internal predecessors, (798), 88 states have call successors, (88), 22 states have call predecessors, (88), 22 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 15:50:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 974 transitions. [2025-01-09 15:50:31,693 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 974 transitions. Word has length 150 [2025-01-09 15:50:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:31,694 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 974 transitions. [2025-01-09 15:50:31,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 974 transitions. [2025-01-09 15:50:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:31,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:31,695 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:31,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:50:31,695 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:31,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1613955853, now seen corresponding path program 1 times [2025-01-09 15:50:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345541921] [2025-01-09 15:50:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:31,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:31,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:31,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:31,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345541921] [2025-01-09 15:50:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345541921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680946155] [2025-01-09 15:50:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:32,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:32,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:32,001 INFO L87 Difference]: Start difference. First operand 754 states and 974 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:32,270 INFO L93 Difference]: Finished difference Result 1580 states and 2040 transitions. [2025-01-09 15:50:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:50:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:50:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:32,274 INFO L225 Difference]: With dead ends: 1580 [2025-01-09 15:50:32,274 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 15:50:32,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:32,280 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 59 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:32,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1257 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 15:50:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 749. [2025-01-09 15:50:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 638 states have (on average 1.2398119122257054) internal successors, (791), 647 states have internal predecessors, (791), 88 states have call successors, (88), 22 states have call predecessors, (88), 22 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 15:50:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 967 transitions. [2025-01-09 15:50:32,330 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 967 transitions. Word has length 150 [2025-01-09 15:50:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 967 transitions. [2025-01-09 15:50:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 967 transitions. [2025-01-09 15:50:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:50:32,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:32,332 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:50:32,332 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:32,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1801323379, now seen corresponding path program 1 times [2025-01-09 15:50:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141739571] [2025-01-09 15:50:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:32,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:50:32,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:50:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141739571] [2025-01-09 15:50:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141739571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:50:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852653197] [2025-01-09 15:50:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:50:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:32,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:50:32,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:32,612 INFO L87 Difference]: Start difference. First operand 749 states and 967 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:32,960 INFO L93 Difference]: Finished difference Result 1479 states and 1904 transitions. [2025-01-09 15:50:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2025-01-09 15:50:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:32,964 INFO L225 Difference]: With dead ends: 1479 [2025-01-09 15:50:32,964 INFO L226 Difference]: Without dead ends: 754 [2025-01-09 15:50:32,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:32,966 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 195 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:32,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 592 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-01-09 15:50:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 632. [2025-01-09 15:50:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 531 states have (on average 1.2203389830508475) internal successors, (648), 538 states have internal predecessors, (648), 80 states have call successors, (80), 20 states have call predecessors, (80), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 15:50:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 808 transitions. [2025-01-09 15:50:33,033 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 808 transitions. Word has length 150 [2025-01-09 15:50:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:33,033 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 808 transitions. [2025-01-09 15:50:33,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 808 transitions. [2025-01-09 15:50:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:50:33,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:33,035 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:33,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:50:33,035 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:33,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2079788693, now seen corresponding path program 1 times [2025-01-09 15:50:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625131544] [2025-01-09 15:50:33,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:33,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:50:33,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:50:33,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:33,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:33,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625131544] [2025-01-09 15:50:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625131544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:33,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:50:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498156755] [2025-01-09 15:50:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:33,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:50:33,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:33,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:50:33,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:33,254 INFO L87 Difference]: Start difference. First operand 632 states and 808 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:33,415 INFO L93 Difference]: Finished difference Result 1313 states and 1675 transitions. [2025-01-09 15:50:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:33,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:50:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:33,424 INFO L225 Difference]: With dead ends: 1313 [2025-01-09 15:50:33,424 INFO L226 Difference]: Without dead ends: 705 [2025-01-09 15:50:33,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:33,425 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 105 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 818 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-01-09 15:50:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 701. [2025-01-09 15:50:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 578 states have (on average 1.2058823529411764) internal successors, (697), 586 states have internal predecessors, (697), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 15:50:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 889 transitions. [2025-01-09 15:50:33,482 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 889 transitions. Word has length 151 [2025-01-09 15:50:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:33,482 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 889 transitions. [2025-01-09 15:50:33,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 889 transitions. [2025-01-09 15:50:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:50:33,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:33,484 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:33,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:50:33,484 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 787947139, now seen corresponding path program 1 times [2025-01-09 15:50:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:33,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719490177] [2025-01-09 15:50:33,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:33,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:50:33,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:50:33,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:33,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719490177] [2025-01-09 15:50:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719490177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:33,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:33,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:50:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662718101] [2025-01-09 15:50:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:33,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:50:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:33,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:50:33,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:33,637 INFO L87 Difference]: Start difference. First operand 701 states and 889 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:33,783 INFO L93 Difference]: Finished difference Result 1370 states and 1737 transitions. [2025-01-09 15:50:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:33,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:50:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:33,788 INFO L225 Difference]: With dead ends: 1370 [2025-01-09 15:50:33,788 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 15:50:33,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:33,789 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 106 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 780 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 15:50:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 622. [2025-01-09 15:50:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 524 states have (on average 1.215648854961832) internal successors, (637), 531 states have internal predecessors, (637), 75 states have call successors, (75), 22 states have call predecessors, (75), 22 states have return successors, (75), 68 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 15:50:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 787 transitions. [2025-01-09 15:50:33,839 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 787 transitions. Word has length 151 [2025-01-09 15:50:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:33,839 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 787 transitions. [2025-01-09 15:50:33,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 787 transitions. [2025-01-09 15:50:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:33,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:33,841 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:33,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:50:33,841 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:33,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1160656832, now seen corresponding path program 1 times [2025-01-09 15:50:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457007805] [2025-01-09 15:50:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:33,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:33,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:33,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:33,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457007805] [2025-01-09 15:50:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457007805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:50:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549024414] [2025-01-09 15:50:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:50:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:34,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:50:34,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:50:34,579 INFO L87 Difference]: Start difference. First operand 622 states and 787 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:35,201 INFO L93 Difference]: Finished difference Result 864 states and 1083 transitions. [2025-01-09 15:50:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:50:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2025-01-09 15:50:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:35,206 INFO L225 Difference]: With dead ends: 864 [2025-01-09 15:50:35,207 INFO L226 Difference]: Without dead ends: 862 [2025-01-09 15:50:35,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:50:35,208 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 225 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:35,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 902 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-01-09 15:50:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 602. [2025-01-09 15:50:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 517 states have internal predecessors, (618), 69 states have call successors, (69), 21 states have call predecessors, (69), 21 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 15:50:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 756 transitions. [2025-01-09 15:50:35,267 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 756 transitions. Word has length 152 [2025-01-09 15:50:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 756 transitions. [2025-01-09 15:50:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 756 transitions. [2025-01-09 15:50:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:35,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:35,268 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:50:35,268 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:35,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1162503874, now seen corresponding path program 1 times [2025-01-09 15:50:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218367331] [2025-01-09 15:50:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:35,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:35,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:35,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:35,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:35,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218367331] [2025-01-09 15:50:35,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218367331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:35,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:35,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:35,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340996578] [2025-01-09 15:50:35,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:35,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:35,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:35,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:35,400 INFO L87 Difference]: Start difference. First operand 602 states and 756 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:35,478 INFO L93 Difference]: Finished difference Result 1257 states and 1577 transitions. [2025-01-09 15:50:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:50:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:35,482 INFO L225 Difference]: With dead ends: 1257 [2025-01-09 15:50:35,482 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 15:50:35,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:35,483 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 94 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:35,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 662 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 15:50:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 657. [2025-01-09 15:50:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 544 states have (on average 1.1838235294117647) internal successors, (644), 551 states have internal predecessors, (644), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 816 transitions. [2025-01-09 15:50:35,616 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 816 transitions. Word has length 152 [2025-01-09 15:50:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:35,617 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 816 transitions. [2025-01-09 15:50:35,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 816 transitions. [2025-01-09 15:50:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:35,618 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:35,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:50:35,618 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:35,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1357456060, now seen corresponding path program 1 times [2025-01-09 15:50:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126636904] [2025-01-09 15:50:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:35,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:35,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:35,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:35,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:50:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:35,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126636904] [2025-01-09 15:50:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126636904] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233478515] [2025-01-09 15:50:35,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:35,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:50:35,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:50:35,749 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-01-09 15:50:35,753 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-01-09 15:50:35,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:35,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:35,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:35,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:50:35,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:35,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:50:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233478515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:35,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:50:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:50:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632867948] [2025-01-09 15:50:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:35,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:35,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:35,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:35,986 INFO L87 Difference]: Start difference. First operand 657 states and 816 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:36,102 INFO L93 Difference]: Finished difference Result 1281 states and 1593 transitions. [2025-01-09 15:50:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:36,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:50:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:36,106 INFO L225 Difference]: With dead ends: 1281 [2025-01-09 15:50:36,106 INFO L226 Difference]: Without dead ends: 678 [2025-01-09 15:50:36,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:36,107 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:36,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 548 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-01-09 15:50:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2025-01-09 15:50:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 565 states have (on average 1.176991150442478) internal successors, (665), 572 states have internal predecessors, (665), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 837 transitions. [2025-01-09 15:50:36,200 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 837 transitions. Word has length 152 [2025-01-09 15:50:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:36,200 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 837 transitions. [2025-01-09 15:50:36,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 837 transitions. [2025-01-09 15:50:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:36,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:36,202 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:36,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:50:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:50:36,403 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -361665966, now seen corresponding path program 1 times [2025-01-09 15:50:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469383456] [2025-01-09 15:50:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:36,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:36,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:36,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:36,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:37,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469383456] [2025-01-09 15:50:37,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469383456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:37,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 15:50:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410746118] [2025-01-09 15:50:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:50:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:37,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:50:37,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:50:37,393 INFO L87 Difference]: Start difference. First operand 678 states and 837 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:38,253 INFO L93 Difference]: Finished difference Result 1499 states and 1849 transitions. [2025-01-09 15:50:38,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:50:38,254 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 152 [2025-01-09 15:50:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:38,257 INFO L225 Difference]: With dead ends: 1499 [2025-01-09 15:50:38,257 INFO L226 Difference]: Without dead ends: 875 [2025-01-09 15:50:38,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-01-09 15:50:38,258 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 330 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:38,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1483 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:50:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-09 15:50:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 709. [2025-01-09 15:50:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 596 states have (on average 1.1828859060402686) internal successors, (705), 603 states have internal predecessors, (705), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 877 transitions. [2025-01-09 15:50:38,328 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 877 transitions. Word has length 152 [2025-01-09 15:50:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:38,329 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 877 transitions. [2025-01-09 15:50:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 877 transitions. [2025-01-09 15:50:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:38,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:38,330 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:38,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:50:38,330 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1641529644, now seen corresponding path program 1 times [2025-01-09 15:50:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299359408] [2025-01-09 15:50:38,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:38,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:38,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:38,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:38,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:38,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299359408] [2025-01-09 15:50:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299359408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:38,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:38,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:50:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365500592] [2025-01-09 15:50:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:38,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:50:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:38,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:50:38,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:50:38,658 INFO L87 Difference]: Start difference. First operand 709 states and 877 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:38,962 INFO L93 Difference]: Finished difference Result 1456 states and 1792 transitions. [2025-01-09 15:50:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2025-01-09 15:50:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:38,965 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 15:50:38,966 INFO L226 Difference]: Without dead ends: 801 [2025-01-09 15:50:38,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:38,967 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 188 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:38,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 681 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-01-09 15:50:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 709. [2025-01-09 15:50:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 596 states have (on average 1.1761744966442953) internal successors, (701), 603 states have internal predecessors, (701), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 873 transitions. [2025-01-09 15:50:39,021 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 873 transitions. Word has length 152 [2025-01-09 15:50:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:39,021 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 873 transitions. [2025-01-09 15:50:39,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 873 transitions. [2025-01-09 15:50:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:39,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:39,022 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:39,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:50:39,022 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:39,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:39,023 INFO L85 PathProgramCache]: Analyzing trace with hash -871139056, now seen corresponding path program 1 times [2025-01-09 15:50:39,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:39,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315535592] [2025-01-09 15:50:39,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:39,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:39,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:39,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:39,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:39,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315535592] [2025-01-09 15:50:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315535592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:39,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:39,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:50:39,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475737135] [2025-01-09 15:50:39,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:39,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:50:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:39,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:50:39,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:39,475 INFO L87 Difference]: Start difference. First operand 709 states and 873 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:40,109 INFO L93 Difference]: Finished difference Result 1532 states and 1873 transitions. [2025-01-09 15:50:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:50:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2025-01-09 15:50:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:40,112 INFO L225 Difference]: With dead ends: 1532 [2025-01-09 15:50:40,112 INFO L226 Difference]: Without dead ends: 877 [2025-01-09 15:50:40,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:50:40,114 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 292 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:40,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1077 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:50:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-01-09 15:50:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 711. [2025-01-09 15:50:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 598 states have (on average 1.1755852842809364) internal successors, (703), 605 states have internal predecessors, (703), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 875 transitions. [2025-01-09 15:50:40,197 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 875 transitions. Word has length 152 [2025-01-09 15:50:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 875 transitions. [2025-01-09 15:50:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 875 transitions. [2025-01-09 15:50:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:40,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:40,199 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:40,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:50:40,200 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash -652284338, now seen corresponding path program 1 times [2025-01-09 15:50:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174362824] [2025-01-09 15:50:40,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:40,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:40,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:40,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174362824] [2025-01-09 15:50:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174362824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:40,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:40,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685950086] [2025-01-09 15:50:40,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:40,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:40,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:40,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:40,399 INFO L87 Difference]: Start difference. First operand 711 states and 875 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:40,578 INFO L93 Difference]: Finished difference Result 1416 states and 1733 transitions. [2025-01-09 15:50:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:50:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:40,581 INFO L225 Difference]: With dead ends: 1416 [2025-01-09 15:50:40,582 INFO L226 Difference]: Without dead ends: 759 [2025-01-09 15:50:40,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:40,583 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 65 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:40,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 596 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-01-09 15:50:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 675. [2025-01-09 15:50:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 562 states have (on average 1.1690391459074734) internal successors, (657), 569 states have internal predecessors, (657), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2025-01-09 15:50:40,646 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 152 [2025-01-09 15:50:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:40,648 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2025-01-09 15:50:40,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2025-01-09 15:50:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:40,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:40,649 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 15:50:40,650 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1360892820, now seen corresponding path program 1 times [2025-01-09 15:50:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091165057] [2025-01-09 15:50:40,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:40,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:40,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:40,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:40,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091165057] [2025-01-09 15:50:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091165057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:40,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:40,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:50:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571959094] [2025-01-09 15:50:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:40,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:50:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:40,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:50:40,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:50:40,909 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:41,221 INFO L93 Difference]: Finished difference Result 1380 states and 1686 transitions. [2025-01-09 15:50:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:50:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2025-01-09 15:50:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:41,225 INFO L225 Difference]: With dead ends: 1380 [2025-01-09 15:50:41,225 INFO L226 Difference]: Without dead ends: 759 [2025-01-09 15:50:41,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:50:41,226 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 208 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:41,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 558 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-01-09 15:50:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 675. [2025-01-09 15:50:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 562 states have (on average 1.1672597864768683) internal successors, (656), 569 states have internal predecessors, (656), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:50:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 828 transitions. [2025-01-09 15:50:41,278 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 828 transitions. Word has length 152 [2025-01-09 15:50:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:41,279 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 828 transitions. [2025-01-09 15:50:41,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 828 transitions. [2025-01-09 15:50:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:50:41,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:41,280 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:41,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 15:50:41,280 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:41,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 851419730, now seen corresponding path program 1 times [2025-01-09 15:50:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821095545] [2025-01-09 15:50:41,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:41,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:50:41,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:50:41,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:41,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821095545] [2025-01-09 15:50:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821095545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:50:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516948435] [2025-01-09 15:50:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:50:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:41,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:50:41,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:50:41,511 INFO L87 Difference]: Start difference. First operand 675 states and 828 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:41,710 INFO L93 Difference]: Finished difference Result 1452 states and 1779 transitions. [2025-01-09 15:50:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:50:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:50:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:41,713 INFO L225 Difference]: With dead ends: 1452 [2025-01-09 15:50:41,713 INFO L226 Difference]: Without dead ends: 831 [2025-01-09 15:50:41,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:50:41,714 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 119 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:41,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2112 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-01-09 15:50:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 754. [2025-01-09 15:50:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 617 states have (on average 1.1539708265802269) internal successors, (712), 625 states have internal predecessors, (712), 105 states have call successors, (105), 31 states have call predecessors, (105), 31 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 15:50:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 922 transitions. [2025-01-09 15:50:41,777 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 922 transitions. Word has length 152 [2025-01-09 15:50:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:41,778 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 922 transitions. [2025-01-09 15:50:41,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 922 transitions. [2025-01-09 15:50:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:50:41,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:41,779 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:41,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 15:50:41,779 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 706504841, now seen corresponding path program 1 times [2025-01-09 15:50:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703151490] [2025-01-09 15:50:41,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:41,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:50:41,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:50:41,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:41,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:42,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703151490] [2025-01-09 15:50:42,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703151490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:42,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:42,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:50:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274739443] [2025-01-09 15:50:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:42,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:50:42,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:42,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:50:42,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:42,279 INFO L87 Difference]: Start difference. First operand 754 states and 922 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:42,727 INFO L93 Difference]: Finished difference Result 1865 states and 2260 transitions. [2025-01-09 15:50:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:50:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 154 [2025-01-09 15:50:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:42,731 INFO L225 Difference]: With dead ends: 1865 [2025-01-09 15:50:42,731 INFO L226 Difference]: Without dead ends: 1165 [2025-01-09 15:50:42,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:42,733 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 237 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:42,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 641 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-01-09 15:50:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 923. [2025-01-09 15:50:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 786 states have (on average 1.1526717557251909) internal successors, (906), 794 states have internal predecessors, (906), 105 states have call successors, (105), 31 states have call predecessors, (105), 31 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 15:50:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1116 transitions. [2025-01-09 15:50:42,817 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1116 transitions. Word has length 154 [2025-01-09 15:50:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:42,817 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1116 transitions. [2025-01-09 15:50:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1116 transitions. [2025-01-09 15:50:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:50:42,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:42,819 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:50:42,819 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 119698827, now seen corresponding path program 1 times [2025-01-09 15:50:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948538279] [2025-01-09 15:50:42,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:42,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:50:42,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:50:42,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:42,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948538279] [2025-01-09 15:50:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948538279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:43,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:43,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:50:43,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54936545] [2025-01-09 15:50:43,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:43,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:43,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:43,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:50:43,100 INFO L87 Difference]: Start difference. First operand 923 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:43,292 INFO L93 Difference]: Finished difference Result 2195 states and 2632 transitions. [2025-01-09 15:50:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:50:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:43,296 INFO L225 Difference]: With dead ends: 2195 [2025-01-09 15:50:43,297 INFO L226 Difference]: Without dead ends: 1326 [2025-01-09 15:50:43,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:50:43,298 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 49 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:43,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 508 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:50:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-01-09 15:50:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1084. [2025-01-09 15:50:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 947 states have (on average 1.1362196409714889) internal successors, (1076), 955 states have internal predecessors, (1076), 105 states have call successors, (105), 31 states have call predecessors, (105), 31 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 15:50:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1286 transitions. [2025-01-09 15:50:43,376 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1286 transitions. Word has length 154 [2025-01-09 15:50:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1286 transitions. [2025-01-09 15:50:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1286 transitions. [2025-01-09 15:50:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:50:43,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:43,378 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:43,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:50:43,378 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:43,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash 197031751, now seen corresponding path program 1 times [2025-01-09 15:50:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:43,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933679364] [2025-01-09 15:50:43,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:43,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:50:43,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:50:43,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:43,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933679364] [2025-01-09 15:50:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933679364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:43,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:43,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:50:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351153795] [2025-01-09 15:50:43,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:43,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:50:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:43,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:50:43,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:43,812 INFO L87 Difference]: Start difference. First operand 1084 states and 1286 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:44,184 INFO L93 Difference]: Finished difference Result 2356 states and 2786 transitions. [2025-01-09 15:50:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:50:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 154 [2025-01-09 15:50:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:44,189 INFO L225 Difference]: With dead ends: 2356 [2025-01-09 15:50:44,189 INFO L226 Difference]: Without dead ends: 1326 [2025-01-09 15:50:44,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:50:44,191 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 191 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:44,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 639 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:50:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-01-09 15:50:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1084. [2025-01-09 15:50:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 947 states have (on average 1.1277719112988385) internal successors, (1068), 955 states have internal predecessors, (1068), 105 states have call successors, (105), 31 states have call predecessors, (105), 31 states have return successors, (105), 97 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 15:50:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1278 transitions. [2025-01-09 15:50:44,266 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1278 transitions. Word has length 154 [2025-01-09 15:50:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:44,266 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1278 transitions. [2025-01-09 15:50:44,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:50:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1278 transitions. [2025-01-09 15:50:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:50:44,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:44,268 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:44,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:50:44,268 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:44,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash -389774263, now seen corresponding path program 1 times [2025-01-09 15:50:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043504879] [2025-01-09 15:50:44,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:44,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:50:44,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:50:44,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:44,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043504879] [2025-01-09 15:50:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043504879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:50:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774359568] [2025-01-09 15:50:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:44,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:50:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:44,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:50:44,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:44,615 INFO L87 Difference]: Start difference. First operand 1084 states and 1278 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:45,107 INFO L93 Difference]: Finished difference Result 2486 states and 2889 transitions. [2025-01-09 15:50:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:50:45,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 154 [2025-01-09 15:50:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:45,111 INFO L225 Difference]: With dead ends: 2486 [2025-01-09 15:50:45,111 INFO L226 Difference]: Without dead ends: 1456 [2025-01-09 15:50:45,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:50:45,113 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 167 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:45,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 966 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:50:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-01-09 15:50:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1394. [2025-01-09 15:50:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1221 states have (on average 1.1023751023751023) internal successors, (1346), 1235 states have internal predecessors, (1346), 129 states have call successors, (129), 43 states have call predecessors, (129), 43 states have return successors, (129), 115 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 15:50:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1604 transitions. [2025-01-09 15:50:45,302 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1604 transitions. Word has length 154 [2025-01-09 15:50:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:45,303 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1604 transitions. [2025-01-09 15:50:45,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:50:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1604 transitions. [2025-01-09 15:50:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:50:45,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:45,304 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:45,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 15:50:45,304 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:45,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1528609333, now seen corresponding path program 1 times [2025-01-09 15:50:45,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:45,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453384558] [2025-01-09 15:50:45,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:45,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:50:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:50:45,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:45,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453384558] [2025-01-09 15:50:45,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453384558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:50:45,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:50:45,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:50:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319715021] [2025-01-09 15:50:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:45,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:50:45,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:45,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:50:45,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:50:45,531 INFO L87 Difference]: Start difference. First operand 1394 states and 1604 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:45,827 INFO L93 Difference]: Finished difference Result 4064 states and 4669 transitions. [2025-01-09 15:50:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:50:45,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:50:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:45,833 INFO L225 Difference]: With dead ends: 4064 [2025-01-09 15:50:45,833 INFO L226 Difference]: Without dead ends: 1426 [2025-01-09 15:50:45,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:50:45,836 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 119 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:45,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1422 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:50:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-01-09 15:50:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1402. [2025-01-09 15:50:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1229 states have (on average 1.0805532953620829) internal successors, (1328), 1243 states have internal predecessors, (1328), 129 states have call successors, (129), 43 states have call predecessors, (129), 43 states have return successors, (129), 115 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 15:50:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1586 transitions. [2025-01-09 15:50:45,956 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1586 transitions. Word has length 155 [2025-01-09 15:50:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:45,956 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 1586 transitions. [2025-01-09 15:50:45,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1586 transitions. [2025-01-09 15:50:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:50:45,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:50:45,958 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:50:45,958 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:50:45,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:50:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -843129929, now seen corresponding path program 1 times [2025-01-09 15:50:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:50:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942955782] [2025-01-09 15:50:45,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:50:45,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:50:46,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:50:46,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:46,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:50:46,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38319355] [2025-01-09 15:50:46,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:50:46,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:50:46,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:50:46,036 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-01-09 15:50:46,038 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-01-09 15:50:46,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:50:46,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:50:46,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:50:46,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:50:46,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 15:50:46,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:50:46,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:50:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:50:46,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:50:46,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:50:46,976 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 17 treesize of output 13 [2025-01-09 15:50:46,986 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 13 treesize of output 9 [2025-01-09 15:50:47,253 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 49 treesize of output 41 [2025-01-09 15:50:47,260 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 66 treesize of output 38 [2025-01-09 15:50:47,268 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 33 treesize of output 25 [2025-01-09 15:50:47,271 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 29 treesize of output 21 [2025-01-09 15:50:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-09 15:50:47,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:50:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:50:47,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:50:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942955782] [2025-01-09 15:50:47,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:50:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38319355] [2025-01-09 15:50:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38319355] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:50:47,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:50:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-01-09 15:50:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058276181] [2025-01-09 15:50:47,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:50:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:50:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:50:47,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:50:47,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:50:47,767 INFO L87 Difference]: Start difference. First operand 1402 states and 1586 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:50:48,763 INFO L93 Difference]: Finished difference Result 2896 states and 3251 transitions. [2025-01-09 15:50:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:50:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:50:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:50:48,766 INFO L225 Difference]: With dead ends: 2896 [2025-01-09 15:50:48,766 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 15:50:48,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:50:48,769 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 88 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:50:48,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 404 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:50:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 15:50:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 15:50:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 15:50:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 15:50:48,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2025-01-09 15:50:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:50:48,771 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 15:50:48,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:50:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 15:50:48,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 15:50:48,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:50:48,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:50:48,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:50:48,977 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:50:48,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.